Hamilton Circuits in Graphs and Directed Graphs

Simple item page
dc.creatorKleiman, Howard
dc.date2000-12-06
dc.date.accessioned2026-07-07T04:39:03Z
dc.date.available2026-07-07T04:39:03Z
dc.descriptionWe give polynomial-time algorithms for obtaining hamilton circuits in random graphs, G, and random directed graphs, D. If n is finite, we assume that G or D contains a hamilton circuit. If G is an arbitrary graph containing a hamilton circuit, we conjecture that Algorithm G always obtains a hamilton circuit in polynomial time.
dc.descriptionText in Word 97, Equations in MathType, sent in a PDF file using Adobe Acrobat Writer (4.05), no figures
dc.identifierhttps://arxiv.org/abs/math/0012036
dc.identifierhttp://arxiv.org/abs/math/0012036
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/60513
dc.subjectCombinatorics
dc.subjectData Structures and Algorithms
dc.titleHamilton Circuits in Graphs and Directed Graphs
dc.typetext

Files

Collections

arXiv