The DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
Sparsification—a technique for speeding up dynamic graph algorithms
Open accessAbstract
We provide data strutures that maintain a graph as edges are inserted and deleted, and keep track of the following properties with the following times: minimum spanning forests, graph connectivity, graph 2-edge connectivity, and bipartiteness in time O ( n 1/2 ) per change; 3-edge connectivity, in time O ( n 2/3 ) per change; 4-edge connectivity, in time O ( n α( n )) per change; k -edge connectivity for constant k , in time O ( n log n ) per change;2-vertex connectivity, and 3-vertex connectivity, in the O ( n ) per change; and 4-vertex connectivity, in time O ( n α( n )) per change. Further results speed up the insertion times to match the bounds of known partially dynamic algorithms. All our algorithms are based on a new technique that transforms an algorithm for sparse graphs into one that will work on any graph, which we call sparsification.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Lecture Notes in Computer Science 1205
(1999) · Industrial Robot: An International Journal · doi:10.1108/ir.1999.04926fae.001 · Cited by 38,662
Harary, F. (1969) · Cited by 10,739
Depth-First Search and Linear Graph Algorithms
Tarjan, R. (1972) · SIAM Journal on Computing · doi:10.1137/0201010 · Cited by 6,081
Combinatorial optimization: networks and matroids
Lawler, E. L. (2021) · Cited by 3,310
Proceedings of the 56th Annual ACM Symposium on Theory of Computing
(2024) · doi:10.1145/3618260 · Cited by 1,730
A data structure for dynamic trees
Sleator, D. D., & Tarjan, R. E. (1983) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(83)90006-5 · Cited by 1,018
Efficient algorithms for finding minimum spanning trees in undirected and directed graphs
Gabow, H. N., Galil, Z., Spencer, T., & Tarjan, R. E. (1986) · Combinatorica · doi:10.1007/bf02579168 · Cited by 517
Self-citationA randomized linear-time algorithm to find minimum spanning trees
Karger, D. R., Klein, P. N., & Tarjan, R. E. (1995) · Journal of the ACM · doi:10.1145/201019.201022 · Cited by 406
Maintenance of a minimum spanning forest in a dynamic plane graph
Eppstein, D., Italiano, G. F., Tamassia, R., Tarjan, R. E., Westbrook, J., & Yung, M. M. (1992) · Journal of Algorithms · doi:10.1016/0196-6774(92)90004-v · Cited by 134
Self-citationLower Bounds for Fully Dynamic Connectivity Problems in Graphs
Henzinger, M. R., & Fredman, M. L. (1998) · Algorithmica · doi:10.1007/pl00009228 · Cited by 66
Cited by
DropEdge: Towards Deep Graph Convolutional Networks on Node Classification
Rong, Y., Huang, W., Xu, T., & Huang, J. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1907.10903 · Cited by 607
Configuring Random Graph Models with Fixed Degree Sequences
Fosdick, B. K., Larremore, D. B., Nishimura, J., & Ugander, J. (2018) · SIAM Review · doi:10.1137/16m1087175 · Cited by 246
Metadata
- Authors
- Eppstein, D., Galil, Z., Italiano, G. F., & Nissenzweig, A.
- Venue
- Journal of the ACM
- Published
- 1997-09
- Volume
- 44
- Issue
- 5
- Pages
- 669-696
- ISSN
- 0004-5411 (ISSN-L)
- 1557-735X
- OpenAlex
- W2009695707
- Cited by
- 282
- References
- 11
- FWCI
- 13.67
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Sparsification—a technique for speeding up dynamic graph algorithms. https://app.cochat.ai/papers/10.1145/265910.265914
- The paper
- Eppstein, D., Galil, Z., Italiano, G. F., & Nissenzweig, A. (1997). Sparsification—a technique for speeding up dynamic graph algorithms. Journal of the ACM. https://doi.org/10.1145/265910.265914
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.