149 search results - page 1 / 30 » The Longest Path Problem Is Polynomial on Interval Graphs |
MFCS
2009
Springer
14 years 3 hour ago
2009
Springer
The longest path problem is the problem of finding a path of maximum length in a graph. Polynomial solutions for this problem are known only for small classes of graphs, while it ...
IJFCS
2007
13 years 5 months ago
2007
The longest path problem is to find a longest path in a given graph. While the graph classes in which the Hamiltonian path problem can be solved efficiently are widely investigat...
ALGORITHMICA
2010
13 years 5 months ago
2010
Abstract We consider a variant of the path cover problem, namely, the k-fixedendpoint path cover problem, or kPC for short, on interval graphs. Given a graph G and a subset T of k ...
TCS
2010
13 years 3 months ago
2010
: We study a variant of the path cover problem, namely, the k-fixed-endpoint path cover problem, or kPC for short. Given a graph G and a subset T of k vertices of V (G), a k-fixe...
TCS
2008
13 years 5 months ago
2008
This paper deals with the existence and search of properly edgecolored paths/trails between two, not necessarily distinct, vertices s and t in an edge-colored graph from an algori...