Sciweavers

1447 search results - page 86 / 290
» Graphs and Path Equilibria
Sort
View
119
Voted
SWAT
2004
Springer
146views Algorithms» more  SWAT 2004»
15 years 9 months ago
Cache-Oblivious Data Structures and Algorithms for Undirected Breadth-First Search and Shortest Paths
We present improved cache-oblivious data structures and algorithms for breadth-first search and the single-source shortest path problem on undirected graphs with non-negative edge...
Gerth Stølting Brodal, Rolf Fagerberg, Ulri...
PUK
2003
15 years 5 months ago
Accelerating Heuristic Search in Spatial Domains
This paper exploits the spatial representation of state space problem graphs to preprocess and enhance heuristic search engines. It combines classical AI exploration with computati...
Stefan Edelkamp, Shahid Jabbar, Thomas Willhalm
140
Voted
PLDI
2004
ACM
15 years 9 months ago
Parametric regular path queries
Regular path queries are a way of declaratively expressing queries on graphs as regular-expression-like patterns that are matched against paths in the graph. There are two kinds o...
Yanhong A. Liu, Tom Rothamel, Fuxiang Yu, Scott D....
ICALP
1995
Springer
15 years 7 months ago
Shortest Path Queries in Digraphs of Small Treewidth
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...
Shiva Chaudhuri, Christos D. Zaroliagis
IPL
2011
88views more  IPL 2011»
14 years 11 months ago
Smooth movement and Manhattan path based Random Waypoint mobility
In this paper, we study the stationary node distribution of a variation of the Random Waypoint mobility model, in which nodes move in a smooth way following one randomly chosen Ma...
Pilu Crescenzi, Miriam Di Ianni, Andrea Marino, Do...