1172 search results - page 74 / 235 » Path Algorithms on Regular Graphs |
110
click to vote
VLDB
2002
ACM
15 years 2 days ago
2002
ACM
All existing proposals for querying XML (e.g., XQuery) rely on a pattern-specification language that allows (1) path navigation and branching through the label structure of the XM...
102
Voted
SPAA
2005
ACM
15 years 6 months ago
2005
ACM
We prove that with high probability a skip graph contains a 4-regular expander as a subgraph, and estimate the quality of the expansion via simulations. As a consequence skip grap...
110
Voted
ISVC
2009
Springer
15 years 7 months ago
2009
Springer
Throughout history, the primary means of transportation for humans has been on foot. We present a software tool which can help visualize and predict where historical trails might l...
ISPD
1999
ACM
15 years 4 months ago
1999
ACM
—Maze routing algorithms are widely used for finding an optimal path in detailed routing for very large scale integration, printed circuit board and multichip modules In this pap...
274
click to vote
COCOON
2011
Springer
14 years 8 days ago
2011
Springer
Motivated by a security problem in geographic information systems, we study the following graph theoretical problem: given a graph G, two special nodes s and t in G, and a number k...