Finding a Path of Superlogarithmic Length

Authors:
Andreas Björklund;Thore Husfeldt
Affiliations:
-;-
Venue:
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Year:
2002

Citing 6
Cited 2

On linear time minor tests with depth-first search

Journal of Algorithms
Color-coding

Journal of the ACM (JACM)
On limited nondeterminism and the complexity of the V-C dimension

Journal of Computer and System Sciences
Finding long paths and cycles in sparse Hamiltonian graphs

STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
An approximation algorithm for finding a long path in Hamiltonian graphs

SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness

Finding a long directed cycle

SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
An approximation algorithm for finding long paths in Hamiltonian graphs

Journal of Algorithms - Special issue: SODA 2000

Quantified Score

Hi-index	0.01

Visualization

Abstract

We consider the problem of finding a long, simple path in an undirected graph. We present a polynomial-time algorithm that finds a path of length 驴 (log L/log log L)2), where L denotes the length of the longest simple path in the graph.This establishes the performance ratio O|V|(log log |V|/log |V|)2) for the Longest Path problem, where V denotes the graph's vertices.