Sciweavers

1594 search results - page 9 / 319
» An Algorithm to Compute Collusion Paths
Sort
View
113
Voted
WG
2010
Springer
15 years 19 days ago
From Path Graphs to Directed Path Graphs
We present a linear time algorithm to greedily orient the edges of a path graph model to obtain a directed path graph model (when possible). Moreover we extend this algorithm to fi...
Steven Chaplick, Marisa Gutierrez, Benjamin L&eacu...
119
Voted
FCT
1995
Springer
15 years 6 months ago
Fast Algorithms for Maintaining Shortest Paths in Outerplanar and Planar Digraphs
Abstract. We present algorithms for maintaining shortest path information in dynamic outerplanar digraphs with sublogarithmic query time. By choosing appropriate parameters we achi...
Hristo Djidjev, Grammati E. Pantziou, Christos D. ...
138
Voted
TON
2010
158views more  TON 2010»
15 years 1 months ago
Always acyclic distributed path computation
Abstract—Distributed routing algorithms may give rise to transient loops during path recomputation, which can pose significant stability problems in high-speed networks. We pres...
Saikat Ray, Roch Guérin, Kin Wah Kwong, Rut...
115
Voted
SOFSEM
2010
Springer
15 years 11 months ago
A Linear Time Algorithm for Finding Three Edge-Disjoint Paths in Eulerian Networks
Maxim A. Babenko, Ignat I. Kolesnichenko, Ilya P. ...
64
Voted
IPPS
2006
IEEE
15 years 8 months ago
A nature-inspired algorithm for the disjoint paths problem
Maria J. Blesa, Christian Blum