Maintenance of 2- and 3-Connected Components of Graphs, Part I: 2- and 3-Edge-Connected Components (1990)
by
J.A. La Poutré
,
J. A. La Poutr
,
J. Van Leeuwen
,
J. Van Leeuwen
,
M. H. Overmars
,
M. H. Overmars
| Citations: | 4 - 0 self |
BibTeX
@TECHREPORT{Poutré90maintenanceof,
author = {J.A. La Poutré and J. A. La Poutr and J. Van Leeuwen and J. Van Leeuwen and M. H. Overmars and M. H. Overmars},
title = {Maintenance of 2- and 3-Connected Components of Graphs, Part I: 2- and 3-Edge-Connected Components},
institution = {},
year = {1990}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
In this paper a data structure is presented to efficiently maintain the 2and 3-edge-connected components of a graph, under insertions of edges in the graph. Starting from an "empty" graph of n nodes, the insertion of e edges takes O(nlogn-[- e) time in total. The data structure allows for insertions of nodes also (in the same time bounds, taking n as the final number of nodes).
Citations
| 883 | Graph theory - Harary - 1972 |
| 217 | Efficiency of a good but not linear set union algorithm - Tarjan - 1975 |
| 139 | Data structures for on-line updating of minimum spanning trees - Frederickson - 1983 |
| 77 | The design and analysis of computer algorithms (Addison-Wesley - Aho, Hopcroft, et al. - 1974 |
| 32 | Amortized efficiency of a path retrieval data structure - Italiano - 1986 |
| 28 | Finding paths and deleting edges in directed acyclic graphs - Italiano - 1988 |
| 28 | 1984], Graph algorithms and NPcompleteness - Mehlhorn |
| 7 | Leeuwen, "Worst case analysis of set union algorithms - Tarjan, van - 1984 |
| 4 | Maintenance of transitive closure and transitive reduction of graphs - Poutr', L, et al. - 1988 |
| 4 | on Discrete Algorithms (SODA - Symp - 1990 |
| 3 | Bounds for the Union-Find and the - Poutr, Lower - 1990 |
| 1 | A Fast and Optimal Algorithm for an Extension of the SplitFind Problem on Pointer Machines - Poutr - 1989 |
| 1 | A dynamization of the all pairs least cost path problem - Sci - 1988 |
