EXPECTED COMPUTATION TIME FOR HAMILTONIAN PATH PROBLEM.

Yuri Gurevich; Saharon Shelah

doi:10.1137/0216034

EXPECTED COMPUTATION TIME FOR HAMILTONIAN PATH PROBLEM.

Yuri Gurevich^*, Saharon Shelah

^*Corresponding author for this work

Research output: Contribution to journal › Article › peer-review

96 Scopus citations

Abstract

One way to cope with an NP-hard problem is to find an algorithm that is fact on average with respect to a natural probability distribution on inputs. We consider from that point of view the Hamiltonian Path Problem. Our algorithm for the Hamiltonian Path Problem constructs or establishes the nonexistence of a Hamiltonian path. For a fixed probability p, the expected run-time of our algorithm on a random graph with n vertices and the edge probability p is O(n). The algorithm is adaptable to directed graphs.

Original language	English
Pages (from-to)	486-502
Number of pages	17
Journal	SIAM Journal on Computing
Volume	16
Issue number	3
DOIs	https://doi.org/10.1137/0216034
State	Published - 1987
Externally published	Yes

Access to Document

10.1137/0216034

Cite this

@article{d83140184b02448fbea0d3d61ca2a94d,

title = "EXPECTED COMPUTATION TIME FOR HAMILTONIAN PATH PROBLEM.",

abstract = "One way to cope with an NP-hard problem is to find an algorithm that is fact on average with respect to a natural probability distribution on inputs. We consider from that point of view the Hamiltonian Path Problem. Our algorithm for the Hamiltonian Path Problem constructs or establishes the nonexistence of a Hamiltonian path. For a fixed probability p, the expected run-time of our algorithm on a random graph with n vertices and the edge probability p is O(n). The algorithm is adaptable to directed graphs.",

author = "Yuri Gurevich and Saharon Shelah",

year = "1987",

doi = "10.1137/0216034",

language = "אנגלית",

volume = "16",

pages = "486--502",

journal = "SIAM Journal on Computing",

issn = "0097-5397",

publisher = "Society for Industrial and Applied Mathematics Publications",

number = "3",

}

TY - JOUR

T1 - EXPECTED COMPUTATION TIME FOR HAMILTONIAN PATH PROBLEM.

AU - Gurevich, Yuri

AU - Shelah, Saharon

PY - 1987

Y1 - 1987

N2 - One way to cope with an NP-hard problem is to find an algorithm that is fact on average with respect to a natural probability distribution on inputs. We consider from that point of view the Hamiltonian Path Problem. Our algorithm for the Hamiltonian Path Problem constructs or establishes the nonexistence of a Hamiltonian path. For a fixed probability p, the expected run-time of our algorithm on a random graph with n vertices and the edge probability p is O(n). The algorithm is adaptable to directed graphs.

AB - One way to cope with an NP-hard problem is to find an algorithm that is fact on average with respect to a natural probability distribution on inputs. We consider from that point of view the Hamiltonian Path Problem. Our algorithm for the Hamiltonian Path Problem constructs or establishes the nonexistence of a Hamiltonian path. For a fixed probability p, the expected run-time of our algorithm on a random graph with n vertices and the edge probability p is O(n). The algorithm is adaptable to directed graphs.

UR - http://www.scopus.com/inward/record.url?scp=0023363216&partnerID=8YFLogxK

U2 - 10.1137/0216034

DO - 10.1137/0216034

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:0023363216

SN - 0097-5397

VL - 16

SP - 486

EP - 502

JO - SIAM Journal on Computing

JF - SIAM Journal on Computing

IS - 3

ER -

EXPECTED COMPUTATION TIME FOR HAMILTONIAN PATH PROBLEM.

Abstract

Access to Document

Other files and links

Fingerprint

Cite this