# Hamiltonian path

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2005

2005

- BMVC
- 2005

For some computer vision tasks, the presence of shadows in images can cause problems. For example, object tracks can be lost asâ€¦Â (More)

Is this relevant?

Highly Cited

2004

Highly Cited

2004

- IEEE Transactions on Computers
- 2004

The arrangement graph A/sub n,k/ is a generalization of the star graph. There are some results concerning fault Hamiltonicity andâ€¦Â (More)

Is this relevant?

Highly Cited

2002

Highly Cited

2002

- 2002

For the traveling salesman problem in which the distances satisfy the triangle inequality, Christofides' heuristic produces aâ€¦Â (More)

Is this relevant?

2002

2002

- DNA
- 2002

A universal design for a biochip that reads out DNA en coded graphs is enhanced by a readout technique that may resolve mul tipleâ€¦Â (More)

Is this relevant?

Highly Cited

1997

Highly Cited

1997

- Algorithmica
- 1997

We consider the problem of approximating the longest path in undirected graphs. In an attempt to pin down the best achievableâ€¦Â (More)

Is this relevant?

Highly Cited

1996

Highly Cited

1996

- The Visual Computer
- 1996

High-performance rendering engines are often pipelined; their speed is bounded by the rate at which triangulation data can beâ€¦Â (More)

Is this relevant?

1993

1993

- Math. Program.
- 1993

We introduce a projective approach for studying symmetric travelling salesman polytopes (STSPs). The symmetric travellingâ€¦Â (More)

Is this relevant?

1983

1983

- Journal of Graph Theory
- 1983

The Hamiltonian path graph H(G) of a graph G is that graph having the same vertex set as G and in which two vertices u and v areâ€¦Â (More)

Is this relevant?

Highly Cited

1982

Highly Cited

1982

- Discrete Mathematics
- 1982

Let .S generate the gror p G. The Cayley diagram of the generators S in G is a directed graph denoted by Cay(S). In thi: najjerâ€¦Â (More)

Is this relevant?

Highly Cited

1972

Highly Cited

1972

- Discrete Mathematics
- 1972

Proof. Let G satisfy the hypothesis of Theorem 1. Clearly, G contains a circuit ; let C be the longest one . If G has noâ€¦Â (More)

Is this relevant?