1206 search results - page 1 / 242 » Arc-Flags in Dynamic Graphs |
ATMOS
2009
13 years 6 months ago
2009
Abstract. Computation of quickest paths has undergoing a rapid development in recent years. It turns out that many high-performance route planning algorithms are made up of several...
CORR
2011
Springer
13 years 5 days ago
2011
Springer
Dynamic graphs have emerged as an appropriate model to capture the changing nature of many modern networks, such as peer-to-peer overlays and mobile ad hoc networks. Most of the re...
GD
2005
Springer
13 years 10 months ago
2005
Springer
Spectral methods are naturally suited for dynamic graph layout, because moderate changes of a graph yield moderate changes of the layout under weak assumptions. We discuss some gen...
ACSC
2005
IEEE
13 years 10 months ago
2005
IEEE
Many classical graph visualization algorithms have already been developed over the past decades. However, these algorithms face difficulties in practice, such as the overlapping n...
WG
2009
Springer
13 years 11 months ago
2009
Springer
We present a fully dynamic algorithm that maintains three different representations of an interval graph: a minimal interval model of the graph, the PQ-tree of its maximal cliques...