Sciweavers

169 search results - page 17 / 34
» Counting paths in digraphs
Sort
View
ATMOS
2007
13 years 11 months ago
Maintenance of Multi-level Overlay Graphs for Timetable Queries
In railways systems the timetable is typically represented as a weighted digraph on which itinerary queries are answered by shortest path algorithms, usually running Dijkstra’s a...
Francesco Bruera, Serafino Cicerone, Gianlorenzo D...
ANOR
2005
102views more  ANOR 2005»
13 years 9 months ago
Locating Active Sensors on Traffic Networks
Sensors are used to monitor traffic in networks. For example, in transportation networks, they may be used to measure traffic volumes on given arcs and paths of the network. This p...
Monica Gentili, Pitu B. Mirchandani
IMC
2009
ACM
14 years 4 months ago
Sampling biases in network path measurements and what to do about it
We show that currently prevalent practices for network path measurements can produce inaccurate inferences because of sampling biases. The inferred mean path latency can be more t...
Srikanth Kandula, Ratul Mahajan
TON
2002
99views more  TON 2002»
13 years 9 months ago
Computing shortest paths for any number of hops
In this paper we introduce and investigate a new" path optimization problem which we denote as the All Hops Optimal Path AHOP problem. The problem involves identifying, for a...
Roch Guérin, Ariel Orda
MOBICOM
2003
ACM
14 years 3 months ago
A high-throughput path metric for multi-hop wireless routing
This paper presents the expected transmission count metric (ETX), which finds high-throughput paths on multi-hop wireless networks. ETX minimizes the expected total number of pac...
Douglas S. J. De Couto, Daniel Aguayo, John C. Bic...