| | |
| | |
Stat |
Members: 3643 Articles: 2'488'730 Articles rated: 2609
29 March 2024 |
|
| | | |
|
Article overview
| |
|
Hamilton Circuits in Graphs and Directed Graphs | Howard Kleiman (Prof. Emer.
; Queensborough Community Coll.
; | Date: |
6 Dec 2000 | Subject: | Combinatorics; Data Structures and Algorithms | math.CO cs.DS | Affiliation: | Prof. Emer., Queensborough Community Coll. (CUNY) | Abstract: | 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. | Source: | arXiv, math.CO/0012036 | Services: | Forum | Review | PDF | Favorites |
|
|
No review found.
Did you like this article?
Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.
browser claudebot
|
| |
|
|
|
| News, job offers and information for researchers and scientists:
| |