1447 search results - page 98 / 290 » Graphs and Path Equilibria |
131
click to vote
FSTTCS
2000
Springer
15 years 7 months ago
2000
Springer
We present a new scheme for storing a planar graph in external memory so that any online path can be traversed in an I-O efficient way. Our storage scheme significantly improves th...
170
click to vote
ALGORITHMICA
2010
15 years 2 months ago
2010
The problem of computing the chromatic number of a P5-free graph (a graph which contains no path on 5 vertices as an induced subgraph) is known to be NP-hard. However, we show tha...
162
Voted
CORR
2011
Springer
14 years 11 months ago
2011
Springer
Stability of Wardrop equilibria is analyzed for dynamical transportation networks in which the drivers’ route choices are influenced by information at multiple temporal and spat...
127
Voted
MICCAI
2007
Springer
16 years 5 months ago
2007
Springer
This paper incorporates multiscale vesselness filtering into the Livewire framework to simultaneously compute optimal medial axes and boundaries in vascular images. To this end, we...
147
click to vote
ICOIN
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. In optical networks, traffic demands often demonstrate periodic nature for which time-overlapping property can be utilized in routing and wavelength assignment (RWA). A R...