1986 search results - page 275 / 398 » Path Separability of Graphs |
116
Voted
CONEXT
2007
ACM
15 years 6 months ago
2007
ACM
Portable devices have more data storage and increasing communication capabilities everyday. In addition to classic infrastructure based communication, these devices can exploit hu...
113
click to vote
APPROX
2006
Springer
15 years 6 months ago
2006
Springer
Abstract. We introduce and study the following model for routing uncertain demands through a network. We are given a capacitated multicommodity flow network with a single source an...
123
Voted
PODS
1991
ACM
15 years 6 months ago
1991
ACM
A novel approach is proposed for ezpresaing and computing eficienily a large cla88 of problem8, including jinding the shortest path in a graph, that were previously considered imp...
125
click to vote
SODA
2008
ACM
15 years 4 months ago
2008
ACM
Greedy Routing is a class of routing algorithms in which the packets are forwarded in a manner that reduces the distance to the destination at every step. In an attempt to provide...
105
click to vote
SODA
2004
ACM
15 years 3 months ago
2004
ACM
We study perfect-information stochastic parity games. These are two-player nonterminating games which are played on a graph with turn-based probabilistic transitions. A play resul...