10 search results - page 1 / 2 » icalp 1995 |
66
Voted
ICALP
1995
Springer
15 years 1 months ago
1995
Springer
81
Voted
ICALP
1995
Springer
15 years 1 months ago
1995
Springer
70
Voted
ICALP
1995
Springer
15 years 1 months ago
1995
Springer
We consider the problem of preprocessing an n-vertex digraph with real edge weights so that subsequent queries for the shortest path or distance between any two vertices can be efï...
136
Voted
ICALP
1995
Springer
15 years 1 months ago
1995
Springer
The problem to determine whether a given k-colored graph is a subgraph of a properly colored interval graph has an application in DNA physical mapping. In this paper, we study the...
78
Voted
ICALP
1995
Springer
15 years 1 months ago
1995
Springer
We describe the rst parallel algorithm with optimal speedup for constructing minimum-width tree decompositions of graphs of bounded treewidth. On n-vertex input graphs, the algori...