1986 search results - page 92 / 398 » Path Separability of Graphs |
SIGECOM
2005
ACM
14 years 2 months ago
2005
ACM
We address the problem of lowering the buyer’s expected payments in shortest path auctions, where the buyer’s goal is to purchase a path in a graph in which edges are owned by...
DM
2008
13 years 9 months ago
2008
For a simple path Pr on r vertices, the square of Pr is the graph P2 r on the same set of vertices of Pr , and where every pair of vertices of distance two or less in Pr is connec...
JDA
2006
13 years 8 months ago
2006
In this paper, we survey fully dynamic algorithms for path problems on general directed graphs. In particular, we consider two fundamental problems: dynamic transitive closure and...
CSR
2009
Springer
14 years 3 months ago
2009
Springer
The 2-Disjoint Connected Subgraphs problem asks if a given graph has two vertex-disjoint connected subgraphs containing prespecified sets of vertices. We show that this problem is...
SI3D
2003
ACM
14 years 2 months ago
2003
ACM
We present a novel approach for interactive navigation in complex 3D synthetic environments using path planning. Our algorithm precomputes a global roadmap of the environment by u...