2294 search results - page 46 / 459 » From Path Graphs to Directed Path Graphs |
STOC
2003
ACM
15 years 10 months ago
2003
ACM
IPL
2010
14 years 8 months ago
2010
We present an O(n) Breadth-First Search algorithm for trapezoid graphs, which takes as input a trapezoid model and any priority order on the vertices. Our algorithm is the first ...
106
click to vote
STACS
1994
Springer
15 years 1 months ago
1994
Springer
The complexity of the simple maxcut problem is investigated for several special classes of graphs. It is shown that this problem is NP-complete when restricted to one of the follo...
ALGORITHMICA
2010
14 years 9 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 ...
ALENEX
2010
14 years 11 months ago
2010
We present the first fast route planning algorithm that answers shortest paths queries for a customizable linear combination of two different metrics, e. g. travel time and energy...