2304 search results - page 285 / 461 » On the Vulnerability of Large Graphs |
162
click to vote
ALENEX
2010
15 years 8 months ago
2010
We present the first fast route planning algorithm that answers shortest paths queries for a customizable linear combination of two different metrics, e. g. travel time and energy...
144
click to vote
ALENEX
2001
15 years 8 months ago
2001
Speed-up techniques that exploit given node coordinates have proven useful for shortest-path computations in transportation networks and geographic information systems. To facilita...
152
click to vote
AUTOMATICA
2007
15 years 6 months ago
2007
This paper is devoted to the generic observability analysis for structured bilinear systems using a graph-theoretic approach. On the basis of a digraph representation, we express ...
156
click to vote
DM
2010
15 years 6 months ago
2010
A k-rainbow path in a graph with colored edges is a path of length k where each edge has a different color. In this note, we settle the problem of obtaining a constructive k-colori...
157
click to vote
ALGOSENSORS
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. We present a distributed multi-scale dead-reckoning (MSDR-D) algorithm for network localization that utilizes local distance and angular information for nearby sensors. T...