D. M. Yellin. A dynamic transitive closure algorithm. Technical Report 13535, IBM Research Division, T. J. Watson Research Center, 1988. 55  Home/Search   Document Not in Database   Summary   Related Articles   Check

....Italy. 1 Introduction In the last decade there has been a growing interest in dynamic problems on graphs. In particular, much attention has been devoted to the dynamic maintenance of connected components [14, 16, 43] and higher connectivity [8, 10, 18, 19, 20, 21, 32, 35, 53] transitive closure [29, 30, 31, 37, 47, 55], planarity [7, 8, 46] shortest paths [2, 5, 13, 39, 44] and minimum spanning trees [10, 11, 16] In these problems one would like to answer queries on graphs that are undergoing a sequence of updates, such as insertions and deletions of edges and vertices. The goal of a dynamic graph algorithm ....

D. M. Yellin. A dynamic transitive closure algorithm. Technical Report 13535, IBM Research Division, T. J. Watson Research Center, 1988. 55

.... 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 known. As mentioned in [30] the fully dynamic maintenance of the connected components of a ....

.... 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 known. As mentioned in [30] the fully dynamic maintenance of the connected components of a graph differs substantially from the fully dynamic maintenance of ....

D. M. Yellin, "A dynamic transitive closure algorithm", Research Report, IBM Research Division, T. J. Watson Research Center, 1988.

....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 maintaining the embedding of a planar graph [29] and ....

....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 maintaining the embedding of a planar graph [29] and for incremental planarity testing [2, 3] ....

D. Yellin. A dynamic transitive closure algorithm. Technical report, IBM Research Division, T. J. Watson Research Center, Yorktown Heights, NY, 1988.

No context found.

D. Yellin, "A Dynamic Transitive Closure Algorithm," IBM T.J. Watson Research Center, Research Report, 1988.

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