1986 search results - page 21 / 398 » Path Separability of Graphs |
203
click to vote
ICDE
2008
IEEE
16 years 1 months ago
2008
IEEE
Abstract-- We present an original graph embedding to speedup distance-range and k-nearest neighbor queries on static and/or dynamic objects located on a (weighted) graph. Our metho...
STOC
2007
ACM
16 years 1 days ago
2007
ACM
In the all-pairs bottleneck paths (APBP) problem (a.k.a. allpairs maximum capacity paths), one is given a directed graph with real non-negative capacities on its edges and is aske...
INFOCOM
1993
IEEE
15 years 3 months ago
1993
IEEE
Passive, single-hop interconnections among N stations, each with several transmitters and receivers, provide a communication path between any two stations using one of the transmi...
107
click to vote
MOR
2010
14 years 10 months ago
2010
We extend the work of Letchford (2000) by introducing a new class of valid inequalities for the traveling salesman problem, called the generalized domino-parity (GDP) constraints....
95
Voted
CCCG
2010
15 years 1 months ago
2010
Do convex obstacles in the plane always leave 3 separate escape routes? Here, an escape route is a locally geodesic path that avoids the obstacles; escape routes are separate if t...