An Efficient NC Algorithm for Finding Hamiltonian Cycles in Dense Directed Graphs
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

Martin Fürer
An Efficient NC Algorithm for Finding Hamiltonian Cycles in Dense Directed Graphs
ICALP, 1991.

ICALP 1991
DBLP
Scholar
DOI
Full names Links ISxN
@inproceedings{ICALP-1991-Furer,
	author        = "Martin Fürer",
	booktitle     = "{Proceedings of the 18th International Colloquium on Automata, Languages and Programming}",
	doi           = "10.1007/3-540-54233-7_153",
	isbn          = "3-540-54233-7",
	pages         = "429--440",
	publisher     = "{Springer-Verlag}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{An Efficient NC Algorithm for Finding Hamiltonian Cycles in Dense Directed Graphs}",
	volume        = 510,
	year          = 1991,
}

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.