D. Harel, "On-line maintenance of the connected components of dynamic graphs", Unpublished manuscript, 1982. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Maintaining Biconnected Components of Dynamic Planar Graphs - Galil, Italiano (1991) (12 citations) (Correct)
.... operation [11] using the dynamic trees of Sleator and Tarjan [22, 23] However, in both cases no better bound than O( p m ) is known for the corresponding fully dynamic problems [11] Moreover, despite intensive research on dynamic problems on graphs (such as dynamic maintenance of connectivity [7, 8, 10, 11, 14, 20, 22, 29, 30], 2 and 3 connectivity [7, 12, 29, 30] transitive closure [3, 4, 15, 16, 17, 18, 19, 31] planar graphs [6, 7, 19, 25] shortest paths [2, 9, 21, 24, 31] and minimum spanning trees [5, 8, 11, 24] there are very few graphtheoretic problems for which a fully dynamic non trivial algorithm is ....
D. Harel, "On-line maintenance of the connected components of dynamic graphs", Unpublished manuscript, 1982.
Lower And Upper Bounds For Incremental Algorithms - Berman (1992) (2 citations) (Correct)
....of interest in what are known as incremental, dynamic, or on line algorithms. The idea is to develop algorithms that can adjust their answers efficiently in response to changes in the input data. Domains for such algorithms have included: ffl graph theoretic algorithms: connectivity [ES81, Har83, Che84] spanning trees [SP73, CH78, FS84, Fre85] spanning forests [Wes89] shortest paths [Rod68, Che76, GSV78, Fuj81, CC82, Gaz83, EG85, AMSN89, AIMSN90, Ita91] biconnected components [Sac86, WT92, BT90] triconnected components [Ita91, BT90] transitive closure [IK83, ....
D. Harel. On line maintenance of the connected components of dynamic graphs. Unpublished manuscipt, 1983.
Maintenance of a Minimum Spanning Forest in a.. - Eppstein, Italiano, .. (1992) (22 citations) (Correct)
....weight of each tree, whether an edge e is currently a spanning edge, and if so, which tree it belongs to. Dynamic problems on graphs have been extensively studied. Several algorithms have been proposed for maintaining fundamental structural information about dynamic graphs, such as connectivity [9, 10, 15, 24, 26], transitive closure [17, 18, 19, 20, 21, 34, 23] and shortest paths [1, 8, 25, 28, 34] Dynamic planar graphs arise in communication networks, graphics, and VLSI design, and they occur in algorithms that build planar subdivisions such as Voronoi diagrams. Algorithms have been proposed for ....
D. Harel. On-line maintenance of the connected components of dynamic graphs. Unpublished manuscript, 1982.
Efficient Gateway Synthesis from Formal Specifications - Kristol, Lee, Netravali.. (1993) (1 citation) (Correct)
....inherently exponential. Algorithm C2 avoids this problem. 2. In Algorithm C2, if we look at each component machine F separately, then this is on line maintenance of the strongly connected components of dynamic graphs. Algorithm C2 is a quadratic algorithm. For undirected graphs, one can do better [ES81, Fr85, Ha82]. However, for directed graphs, it is a challenging problem. On the other hand, our problem is not really on line . We know which edges to delete at the very beginning, and further deletions are due to the mutual constraints of the machines involved and are done iteratively. It would be an ....
D. Harel, "On-line Maintenance of the Connected Components of Dynamic Graphs," Unpublished manuscript, 1982.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC