1172 search results - page 68 / 235 » Path Algorithms on Regular Graphs |
190
click to vote
VLDB
2007
ACM
16 years 20 days ago
2007
ACM
We investigate the problem of how to evaluate efficiently a collection of shortest path queries on massive graphs that are too big to fit in the main memory. To evaluate a shortes...
123
click to vote
ESA
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. Traditional shortest path problems play a central role in both the design and use of communication networks and have been studied extensively. In this work, we consider a...
112
click to vote
JALC
2002
15 years 3 days ago
2002
We define general algebraic frameworks for shortest-distance problems based on the structure of semirings. We give a generic algorithm for finding single-source shortest distances...
91
Voted
EMNLP
2008
15 years 1 months ago
2008
We consider a parsed text corpus as an instance of a labelled directed graph, where nodes represent words and weighted directed edges represent the syntactic relations between the...
103
click to vote
STACS
2010
Springer
15 years 7 months ago
2010
Springer
In 2000 Alber et al. [SWAT 2000 ] obtained the first parameterized subexponential algorithm on undirected planar graphs by showing that k-DOMINATING SET is solvable in time 2O( ...