There Are Spanning Spiders in Dense Graphs (and We Know How to Find Them)
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

Luisa Gargano, Mikael Hammar
There Are Spanning Spiders in Dense Graphs (and We Know How to Find Them)
ICALP, 2003.

ICALP 2003
DBLP
Scholar
DOI
Full names Links ISxN
@inproceedings{ICALP-2003-GarganoH,
	author        = "Luisa Gargano and Mikael Hammar",
	booktitle     = "{Proceedings of the 30th International Colloquium on Automata, Languages and Programming}",
	doi           = "10.1007/3-540-45061-0_63",
	isbn          = "3-540-40493-7",
	pages         = "802--816",
	publisher     = "{Springer International Publishing}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{There Are Spanning Spiders in Dense Graphs (and We Know How to Find Them)}",
	volume        = 2719,
	year          = 2003,
}

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.