Computing the Girth of a Planar Graph in O(n logn) Time
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

Oren Weimann, Raphael Yuster
Computing the Girth of a Planar Graph in O(n logn) Time
ICALP, 2009.

ICALP v1 2009
DBLP
Scholar
DOI
Full names Links ISxN
@inproceedings{ICALP-v1-2009-WeimannY,
	author        = "Oren Weimann and Raphael Yuster",
	booktitle     = "{Proceedings of the 36th International Colloquium on Automata, Languages and Programming, Part I}",
	doi           = "10.1007/978-3-642-02927-1_63",
	isbn          = "978-3-642-02926-4",
	pages         = "764--773",
	publisher     = "{Springer International Publishing}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Computing the Girth of a Planar Graph in O(n logn) Time}",
	volume        = 5555,
	year          = 2009,
}

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.