1172 search results - page 38 / 235 » Path Algorithms on Regular Graphs |
134
Voted
COMPGEOM
2000
ACM
15 years 6 months ago
2000
ACM
The algorithms for computing a shortest path on a polyhedral surface are slow, complicated, and numerically unstable. We have developed and implemented a robust and efficient algo...
SODA
2008
ACM
15 years 3 months ago
2008
ACM
A travel booking office has timetables giving arrival and departure times for all scheduled trains, including their origins and destinations. A customer presents a starting city a...
100
click to vote
AAAI
2004
15 years 3 months ago
2004
In this paper we introduce and study Shortest Path Discovery (SPD) problems, a generalization of shortest path problems: In SPD one is given a directed edgeweighted graph and the ...
129
Voted
CORR
2010
Springer
15 years 2 months ago
2010
Springer
Schnyder woods are decompositions of simple triangulations into three edge-disjoint spanning trees crossing each other in a specific way. In this article, we define a generalizatio...
177
click to vote
SIGIR
2011
ACM
14 years 5 months ago
2011
ACM
As the Internet grows explosively, search engines play a more and more important role for users in effectively accessing online information. Recently, it has been recognized that ...