On the public citation graph

Decremental 2- and 3-connectivity on planar graphs

https://doi.org/10.1007/bf01955676
0 signed · 33 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/3-540-54233-7_146openalex-snapshot
Maintaining biconnected components of dynamic planar graphs
inferredcites →https://doi.org/10.1007/3-540-55706-7_19openalex-snapshot
Dynamic 2- and 3-connectivity on planar graphs
inferredcites →https://doi.org/10.1007/3-540-55706-7_20openalex-snapshot
Fully dynamic 2-edge-connectivity in planar graphs
inferredcites →https://doi.org/10.1007/3-540-55719-9_87openalex-snapshot
Maintenance of triconnected components of graphs
inferredcites →https://doi.org/10.1007/bf01758773openalex-snapshot
Maintaining bridge-connected and biconnected components on-line
inferredcites →https://doi.org/10.1007/bfb0032061openalex-snapshot
On-line graph algorithms with SPQR-trees
inferredcites →https://doi.org/10.1016/0012-365x(93)90376-5openalex-snapshot
Maintenance of 2- and 3-edge- connected components of graphs I
inferredcites →https://doi.org/10.1016/0196-6774(92)90004-vopenalex-snapshot
Maintenance of a minimum spanning forest in a dynamic plane graph
inferredcites →https://doi.org/10.1109/sfcs.1991.185429openalex-snapshot
Ambivalent data structures for dynamic 2-edge-connectivity and k smallest spanning trees
inferredcites →https://doi.org/10.1109/sfcs.1991.185451openalex-snapshot
On-line maintenance of the four-connected components of a graph
inferredcites →https://doi.org/10.1109/sfcs.1992.267818openalex-snapshot
Sparsification-a technique for speeding up dynamic graph algorithms
inferredcites →https://doi.org/10.1109/sfcs.1992.267819openalex-snapshot
Fully dynamic biconnectivity in graphs
inferredcites →https://doi.org/10.1137/0214055openalex-snapshot
Data Structures for On-Line Updating of Minimum Spanning Trees, with Applications
inferredcites →https://doi.org/10.1137/0221062openalex-snapshot
Fully Dynamic Algorithms for 2-Edge Connectivity
inferredcites →https://doi.org/10.1137/0222002openalex-snapshot
Maintaining the 3-Edge-Connected Components of a Graph On-Line
inferredcites →https://doi.org/10.1145/195058.195434openalex-snapshot
Improved data structures for fully dynamic biconnectivity
inferredcites →https://doi.org/10.1145/282918.282923openalex-snapshot
Primitives for the manipulation of general subdivisions and the computation of Voronoi
inferredcites →https://doi.org/10.1145/322234.322235openalex-snapshot
An On-Line Edge-Deletion Problem
inferredcites →https://doi.org/10.1145/800061.808754openalex-snapshot
Data structures for on-line updating of minimum spanning trees

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1006/jagm.2001.1167openalex-snapshot
Unique Maximum Matching Algorithms
inferred← citeshttps://doi.org/10.1007/978-0-387-30162-4_155openalex-snapshot
Fully Dynamic Higher Connectivity for Planar Graphs
inferred← citeshttps://doi.org/10.1007/978-0-387-30162-4_157openalex-snapshot
Fully Dynamic Planarity Testing
inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_155openalex-snapshot
Fully Dynamic Higher Connectivity for Planar Graphs
inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_157openalex-snapshot
Fully Dynamic Planarity Testing
inferred← citeshttps://doi.org/10.1007/s00224-016-9709-xopenalex-snapshot
Optimal Decremental Connectivity in Planar Graphs
inferred← citeshttps://doi.org/10.1007/s00224-024-10181-zopenalex-snapshot
Good r-divisions Imply Optimal Amortized Decremental Biconnectivity
inferred← citeshttps://doi.org/10.1137/s0097539794269072openalex-snapshot
Separator-Based Sparsification II: Edge and Vertex Connectivity
inferred← citeshttps://doi.org/10.1145/300515.300517openalex-snapshot
Fully dynamic planarity testing with applications
inferred← citeshttps://doi.org/10.1145/3055399.3055480openalex-snapshot
Decremental single-source reachability in planar digraphs
inferred← citeshttps://doi.org/10.1201/b16132-52openalex-snapshot
Triangulations
inferred← citeshttps://doi.org/10.4230/lipics.icalp.2023.6openalex-snapshot
Fully-Adaptive Dynamic Connectivity of Square Intersection Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1705.11163openalex-snapshot
Decremental Single-Source Reachability in Planar Digraphs
inferred← citeshttps://doi.org/10.48550/arxiv.1806.10772openalex-snapshot
Decremental SPQR-trees for Planar Graphs
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.