A new approach to dynamic all pairs shortest paths

Demetrescu, Camil; Italiano, Giuseppe F.

doi:10.1145/780564.780567

Cited by 70 publications

(170 citation statements)

References 0 publications

Supporting

Mentioning

168

Contrasting

Order By: Relevance

“…As in the case of dynamic transitive closure, this algorithm is based on clever tree data structures. Finally, the same authors [8] have studied some combinatorial properties of graphs that make it possible to devise a different approach to dynamic APSP problems. Given a directed graph G, subject to dynamic operations, and such that each edge weight can assume at most S different real values, their algorithm supports each update in O(S · n 2.5 log 3 n) amortized time and each query in optimal worst-case time.…”

Section: General Concepts and Techniquesmentioning

confidence: 99%

“…Recently, Demetrescu and Italiano [8] proposed a new approach to dynamic path problems based on maintaining classes of paths characterized by local properties, i.e., properties that hold for all proper subpaths, even if they may not hold for the entire paths. They showed that this approach can play a crucial role in the dynamic maintenance of shortest paths.…”

Section: Localitymentioning

confidence: 99%

“…We refer the interested reader to [8] for a detailed description of this smoothing strategy. Indeed, it is possible to transform every update sequence into a slightly longer equivalent sequence that generates only a few historical paths.…”

Section: At Most O(h) Historical Paths In the Graph Then The Amortizmentioning

confidence: 99%

See 2 more Smart Citations

Dynamic Graph Algorithms

Demetrescu¹,

Eppstein²,

Galil³

et al. 2009

Chapman &Amp; Hall/CRC Applied Algorithms and Data Structures Series

Self Cite

View full text Add to dashboard Cite

Section: General Concepts and Techniquesmentioning

confidence: 99%

Section: Localitymentioning

confidence: 99%

See 1 more Smart Citation

Dynamic Graph Algorithms

Demetrescu¹,

Eppstein²,

Galil³

et al. 2009

Chapman &Amp; Hall/CRC Applied Algorithms and Data Structures Series

Self Cite

View full text Add to dashboard Cite

“…The results of this check (if the flow is allowed) are forwarded to the route computation component which determines the path given the policy constraint. In our implementation all paths are pre-computed and maintained via a dynamic all-pairs shortest path algorithm [13]. Section 4 describes our policy model and implementation.…”

Section: Controllermentioning

confidence: 99%

“…Routes are pre-computed using an all pairs shortest path algorithm [13]. Topology recalculation on link failure is handled by dynamically updating the computation with the modified link-state updates.…”

Section: Controllermentioning

confidence: 99%

Ethane

Casado

Freedman

Pettit

et al. 2007

SIGCOMM Comput. Commun. Rev.

345

View full text Add to dashboard Cite

This paper presents Ethane, a new network architecture for the enterprise. Ethane allows managers to define a single networkwide fine-grain policy, and then enforces it directly. Ethane couples extremely simple flow-based Ethernet switches with a centralized controller that manages the admittance and routing of flows. While radical, this design is backwards-compatible with existing hosts and switches.We have implemented Ethane in both hardware and software, supporting both wired and wireless hosts. Our operational Ethane network has supported over 300 hosts for the past four months in in Stanford University's network, and this deployment experience has significantly affected Ethane's design.

show abstract

Optimizing the ecological connectivity of landscapes

et al. 2022

View full text Add to dashboard Cite

In this paper we consider the problem of optimizing the ecological connectivity of a landscape under a budget constraint by improving habitat areas and ecological corridors between them. We consider a formulation of this problem in terms of graphs in which vertices represent the habitat areas and arcs represent a probability of connection between two areas that depend on the quality of the respective corridor. We propose a new generalized flow model that improves existing models for this problem and an efficient preprocessing algorithm that reduces the size of the graphs on which generalized flows is computed.Reported numerical experiments highlight the benefice of these two contributions on computation times and show that larger problems can be solved using them. Our experiments also show that several variants of greedy algorithms perform relatively well on practical instances while they return arbitrary bad solutions in the worst case.

show abstract

A new approach to dynamic all pairs shortest paths

Cited by 70 publications

References 0 publications

Dynamic Graph Algorithms

Dynamic Graph Algorithms

Ethane

Optimizing the ecological connectivity of landscapes

Contact Info

Product

Resources

About