1447 search results - page 60 / 290 » Graphs and Path Equilibria |
179
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Gossip algorithms have recently received significant attention, mainly because they constitute simple and robust message-passing schemes for distributed information processing over...
183
click to vote
ANTSW
2010
Springer
15 years 28 days ago
2010
Springer
Abstract. We consider the problem of finding and maintaining communication paths in wireless mobile ad hoc networks (MANET). We consider this problem as a bi-objective problem when...
190
click to vote
AAIM
2007
Springer
15 years 10 months ago
2007
Springer
Given an acyclic directed graph and two distinct nodes s and t, we consider the problem of finding k disjoint paths from s to t satisfying some objective. We consider four objectiv...
146
click to vote
ICALP
2010
Springer
15 years 9 months ago
2010
Springer
We present an O(m + n)-time algorithm that tests if a given directed graph is 2-vertex connected, where m is the number of arcs and n is the number of vertices. Based on this resul...
145
click to vote
ICRA
2010
IEEE
15 years 4 months ago
2010
IEEE
— The DPC algorithm developed in our previous work is an efficient way of computing optimal trajectories for multiple robots in a distributed fashion with timeparameterized cons...