"The Kernelization Complexity of Connected Domination in Graphs with (no) ..."

Neeldhara Misra et al. (2014)

> Home

Details and statistics

DOI: 10.1007/S00453-012-9681-Z

access: closed

type: Journal Article

metadata version: 2017-10-30

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/algorithmica/MisraPRS14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/algorithmica/MisraPRS14
Neeldhara Misra, Geevarghese Philip, Venkatesh Raman, Saket Saurabh:
The Kernelization Complexity of Connected Domination in Graphs with (no) Small Cycles. Algorithmica 68(2): 504-530 (2014)

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.