422 search results - page 55 / 85 » Shortest paths between shortest paths and independent sets |
CN
2000
13 years 8 months ago
2000
Hop-by-hop inter-domain routing protocols, such as BGP and IDRP, use independent route selection to realize domains' local policies. A domain chooses its routes based on path...
PVLDB
2010
13 years 7 months ago
2010
The dramatic proliferation of sophisticated networks has resulted in a growing need for supporting effective querying and mining methods over such large-scale graph-structured da...
EDBT
2004
ACM
14 years 8 months ago
2004
ACM
Despite the existence of obstacles in many database applications, traditional spatial query processing utilizes the Euclidean distance metric assuming that points in space are dire...
MOBIHOC
2001
ACM
14 years 8 months ago
2001
ACM
Previously proposed sensor network data dissemination schemes require periodic low-rate flooding of data in order to allow recovery from failure. We consider constructing two kind...
COMPGEOM
2004
ACM
14 years 2 months ago
2004
ACM
Let P be a simple polygon with m vertices, k of which are reflex, and which contains r red points and b blue points in its interior. Let n = m + r + b. A ham-sandwich geodesic is ...