Hamilton Circuits in Graphs and Directed Graphs

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

We 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.
Text in Word 97, Equations in MathType, sent in a PDF file using Adobe Acrobat Writer (4.05), no figures

Keywords

Combinatorics, Data Structures and Algorithms

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/60513

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/math/0012036
 http://arxiv.org/abs/math/0012036

Collections

arXiv