Zvi Galil, Giuseppe F. Italiano  Home/Search
Context Related
| uci.edu/~eppstein/...connectivity.ps.gz Cached: PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
PS.gz PS Image Update HelpFrom: uci.edu/~eppstein/pubs/notmine... (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: ) Zvi Galil y Giuseppe F. Italiano z Abstract We consider the problem of maintaining the 2-edgeconnected and the 3-edge-connected components of a graph undergoing repeated dynamic modifications, such as edge insertions and edge deletions. We show how to test at any time whether two vertices belong to the same 2-edge-connected component, and how to insert and delete an edge in O(m 2=3 ) time in the worst case, where m is the current number of edges in the graph. This answers a question... (Update)
Similar documents based on text: More All
0.4: Fully Dynamic Planarity Testing with Applications - Galil, Italiano, Sarnak (Correct)
0.4: Maintenance of 2- and 3-Connected Components of Graphs, Part I: .. - Poutré, al. (1990) (Correct)
0.2: A 2-Level Cactus Tree Model for the System of Minimum and.. - Dinitz, Nutov (1998) (Correct)
BibTeX entry: (Update)
Z. Galil and G. Italiano, "Fully dynamic algorithms for edge connectivity problems," 23 rd Annual Symposium on Theory of Computing, pp. 317--327, (1991). http://citeseer.ist.psu.edu/galil91fully.html More
@inproceedings{ galil91fully,
author = "Zvi Galil and Giuseppe F. Italiano",
title = "Fully dynamic algorithms for edge connectivity problems",
pages = "317--327",
year = "1991",
url = "citeseer.ist.psu.edu/galil91fully.html" }
Citations (may not include all citations):1450 The Design and Analysis of Computer Algorithms (context) - Aho, Hopcroft et al. - 1974
474 Graph Theory (context) - Harary - 1969
405 Depth-first search and linear graph algorithms (context) - Tarjan - 1972
136 Fast algorithms for finding nearest common ancestors (context) - Harel, Tarjan - 1984
127 A linear-time algorithm for a special case of disjoint set u.. (context) - Gabow, Tarjan - 1985
118 Data structures for on-line updating of minimum spanning tre.. (context) - Frederickson - 1985
77 Dividing a graph into triconnected components (context) - Hopcroft, Tarjan - 1973
77 An efficient parallel biconnectivity algorithm (context) - Tarjan, Vishkin - 1985
55 Worst case analysis of set union algorithms (context) - Tarjan, van Leeuwen - 1984
40 Maintaining bridge-connected and biconnected components onli.. (context) - Westbrook, Tarjan - 1989
32 A priority queue in which initialization and queue operation.. (context) - Johnson - 1982
23 line graph algorithms with SPQR-trees (context) - Di Battista, Tamassia - 1990
15 Maintaining biconnected components of dynamic planar graphs - Galil, Italiano - 1991
14 A topological approach to dynamic graph connectivity (context) - Reif - 1987
4 Personal communication (context) - Mehlhorn - 1990
[Article contains additional citations not shown here]
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.ics.uci.edu/~eppstein/pubs/notmine/): More
Average-Case Ray Shooting and Minimum Weight Triangulations - Aronov, Fortune (1997) (Correct)
Quasi-Greedy Triangulations Approximating the Minimum.. - Levcopoulos, Krznaric (1996) (Correct)
Lovász's Lemma for the Three-Dimensional K-Level of Concave.. - Katoh, Tokuyama (1999) (Correct)
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