An Incremental Polynomial Time Algorithm to Enumerate All Minimal Edge Dominating Sets
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter

Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Yngve Villanger
An Incremental Polynomial Time Algorithm to Enumerate All Minimal Edge Dominating Sets
ICALP, 2013.

ICALP v1 2013
DBLP
Scholar
DOI
Full names Links ISxN
@inproceedings{ICALP-v1-2013-GolovachHKV,
	author        = "Petr A. Golovach and Pinar Heggernes and Dieter Kratsch and Yngve Villanger",
	booktitle     = "{Proceedings of the 40th International Colloquium on Automata, Languages, and Programming, Part I}",
	doi           = "10.1007/978-3-642-39206-1_41",
	isbn          = "978-3-642-39205-4",
	pages         = "485--496",
	publisher     = "{Springer International Publishing}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{An Incremental Polynomial Time Algorithm to Enumerate All Minimal Edge Dominating Sets}",
	volume        = 7965,
	year          = 2013,
}

Tags:



Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.