"On the Algorithmic Complexity of Double Vertex-Edge Domination in Graphs."

Yanamandram B. Venkatakrishnan, H. Naresh Kumar (2019)

> Home

Details and statistics

DOI: 10.1007/978-3-030-10564-8_15

access: closed

type: Conference or Workshop Paper

metadata version: 2019-10-19

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/walcom/Venkatakrishnan19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/walcom/Venkatakrishnan19
Yanamandram B. Venkatakrishnan, H. Naresh Kumar:
On the Algorithmic Complexity of Double Vertex-Edge Domination in Graphs. WALCOM 2019: 188-198

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.