1447 search results - page 72 / 290 » Graphs and Path Equilibria |
137
Voted
COCOA
2008
Springer
15 years 5 months ago
2008
Springer
We study (vertex-disjoint) packings of paths of length two (i.e., of P2's) in graphs under a parameterized perspective. Starting from a maximal P2-packing P of size j we use e...
109
Voted
SIROCCO
2003
15 years 5 months ago
2003
For networks employing shortest-path routing, we introduce a new recovery scheme which needs only one backup routing table. By precomputing this backup table, the network recovers...
137
click to vote
SCAM
2002
IEEE
15 years 9 months ago
2002
IEEE
In this paper, we first present a static analysis based on set-based framework, which estimates exception propagation paths of Java programs. We construct an exception propagatio...
152
Voted
SIAMCOMP
1998
15 years 3 months ago
1998
This paper introduces a near-linear time sequential algorithm for constructing a sparse neighborhood cover. This implies analogous improvements (from quadratic to near-linear time)...
144
Voted
CDC
2009
IEEE
15 years 8 months ago
2009
IEEE
Abstract— The present paper considers distributed consensus algorithms for agents evolving on a connected compact homogeneous (CCH) manifold. The agents track no external referen...