On the public citation graph
Maintaining the 3-Edge-Connected Components of a Graph On-Line
0 signed · 64 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-19422-3_9openalex-snapshot
Maintenance of transitive closures and transitive reductions of graphs
inferredcites →https://doi.org/10.1007/3-540-19488-6_143openalex-snapshot
A dynamic data structure for planar graph embedding
inferredcites →https://doi.org/10.1007/bf01074775openalex-snapshot
Efficient algorithm for finding all minimal edge cuts of a nonoriented graph
inferredcites →https://doi.org/10.1007/bf01758773openalex-snapshot
Maintaining bridge-connected and biconnected components on-line
inferredcites →https://doi.org/10.1007/bf01840401openalex-snapshot
Dynamic maintenance of planar digraphs, with applications
inferredcites →https://doi.org/10.1007/bfb0024016openalex-snapshot
A dynamization of the All Pairs Least Cost Path Problem
inferredcites →https://doi.org/10.1016/0020-0190(83)90033-9openalex-snapshot
On-line computation of transitive closures of graphs
inferredcites →https://doi.org/10.1016/0020-0190(87)90095-0openalex-snapshot
A topological approach to dynamic graph connectivity
inferredcites →https://doi.org/10.1016/0020-0190(88)90136-6openalex-snapshot
Finding paths and deleting edges in directed acyclic graphs
inferredcites →https://doi.org/10.1016/0022-0000(78)90022-3openalex-snapshot
Algorithms for updating minimal spanning trees
inferredcites →https://doi.org/10.1016/0022-0000(83)90006-5openalex-snapshot
A data structure for dynamic trees
inferredcites →https://doi.org/10.1016/0022-0000(85)90014-5openalex-snapshot
A linear-time algorithm for a special case of disjoint set union
inferredcites →https://doi.org/10.1016/0196-6774(91)90036-xopenalex-snapshot
Incremental algorithms for minimal length paths
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.1016/0304-3975(86)90098-8openalex-snapshot
Amortized efficiency of a path retrieval data structure
inferredcites →https://doi.org/10.1137/0201010openalex-snapshot
Depth-First Search and Linear Graph Algorithms
inferredcites →https://doi.org/10.1137/0202012openalex-snapshot
Dividing a Graph into Triconnected Components
inferredcites →https://doi.org/10.1137/0204032openalex-snapshot
On Finding and Updating Spanning Trees and Shortest Paths
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/0214061openalex-snapshot
An Efficient Parallel Biconnectivity Algorithm
inferredcites →https://doi.org/10.1145/122413.122416openalex-snapshot
Reducing edge connectivity to vertex connectivity
inferredcites →https://doi.org/10.1145/322234.322235openalex-snapshot
An On-Line Edge-Deletion Problem
inferredcites →https://doi.org/10.1145/62.2160openalex-snapshot
Worst-case Analysis of Set Union Algorithms
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.1997.0855openalex-snapshot
A Static 2-Approximation Algorithm for Vertex Connectivity and Incremental Approximation Algorithms for Edge and Vertex Connectivity
inferred← citeshttps://doi.org/10.1007/3-540-44985-x_25openalex-snapshot
Incremental Maintenance of the 5-Edge-Connectivity Classes of a Graph
inferred← citeshttps://doi.org/10.1007/3-540-45477-2_10openalex-snapshot
Planarity of the 2-Level Cactus Model
inferred← citeshttps://doi.org/10.1007/3-540-56402-0_44openalex-snapshot
The 3-edge-components and a structural description of all 3-edge-cuts in a graph
inferred← citeshttps://doi.org/10.1007/3-540-60084-1_81openalex-snapshot
Approximating minimum cuts under insertions
inferred← citeshttps://doi.org/10.1007/978-0-387-30162-4_154openalex-snapshot
Fully Dynamic Higher Connectivity
inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_154openalex-snapshot
Fully Dynamic Higher Connectivity
inferred← citeshttps://doi.org/10.1007/978-3-030-25005-8_20openalex-snapshot
Incremental Algorithm for Minimum Cut and Edge Connectivity in Hypergraph
inferred← citeshttps://doi.org/10.1007/978-3-319-09039-9_1openalex-snapshot
The Common Structure of the Curves Having a Same Gauss Word
inferred← citeshttps://doi.org/10.1007/bf01955676openalex-snapshot
Decremental 2- and 3-connectivity on planar graphs
inferred← citeshttps://doi.org/10.1007/s00453-011-9551-0openalex-snapshot
Augmenting the Edge Connectivity of Planar Straight Line Graphs to Three
inferred← citeshttps://doi.org/10.1109/71.946661openalex-snapshot
Fully dynamic maintenance of k-connectivity in parallel
inferred← citeshttps://doi.org/10.1109/comcas.2011.6105945openalex-snapshot
Priority based enhancement of online power-aware routing in wireless sensor network
inferred← citeshttps://doi.org/10.1109/infcom.2009.5062052openalex-snapshot
Fast Recovery from Dual Link Failures in IP Networks
inferred← citeshttps://doi.org/10.1109/infocom.2008.45openalex-snapshot
SRLG Failure Localization in All-Optical Networks Using Monitoring Cycles and Paths
inferred← citeshttps://doi.org/10.1109/istcs.1993.253480openalex-snapshot
Maintaining the 4-edge-connected components of a graph on-line
inferred← citeshttps://doi.org/10.1109/tnet.2008.2008000openalex-snapshot
Single-Link Failure Detection in All-Optical Networks Using Monitoring Cycles and Paths
inferred← citeshttps://doi.org/10.1109/tnet.2010.2055887openalex-snapshot
Fast Recovery From Dual-Link or Single-Node Failures in IP Networks Using Tunneling
inferred← citeshttps://doi.org/10.1109/tnet.2010.2103402openalex-snapshot
SRLG Failure Localization in Optical Networks
inferred← citeshttps://doi.org/10.1109/tnet.2013.2291208openalex-snapshot
On the Maximum Number of Linearly Independent Cycles and Paths in a Network
inferred← citeshttps://doi.org/10.1137/1.9781611974782.31openalex-snapshot
Connectivity Oracles for Graphs Subject to Vertex Failures
inferred← citeshttps://doi.org/10.1137/17m1146610openalex-snapshot
Connectivity Oracles for Graphs Subject to Vertex Failures
inferred← citeshttps://doi.org/10.1137/s0097539793257770openalex-snapshot
Maintenance of 2- and 3-Edge-Connected Components of Graphs II
inferred← citeshttps://doi.org/10.1137/s0097539794269072openalex-snapshot
Separator-Based Sparsification II: Edge and Vertex Connectivity
inferred← citeshttps://doi.org/10.1137/s0097539794272582openalex-snapshot
Dynamic 2-Connectivity with Backtracking
inferred← citeshttps://doi.org/10.1137/s0097539797330045openalex-snapshot
The General Structure of Edge-Connectivity of a Vertex Subset in a Graph and its Incremental Maintenance. Odd Case
inferred← citeshttps://doi.org/10.1145/195058.195439openalex-snapshot
Alpha-algorithms for incremental planarity testing (preliminary version)
inferred← citeshttps://doi.org/10.1145/195058.195442openalex-snapshot
The connectivity carcass of a vertex subset in a graph and its incremental maintenance
inferred← citeshttps://doi.org/10.1145/225058.225268openalex-snapshot
A 2-level cactus model for the system of minimum and minimum+1 edge-cuts in a graph and its incremental maintenance
inferred← citeshttps://doi.org/10.1145/264216.264223openalex-snapshot
An empirical study of dynamic graph algorithms
inferred← citeshttps://doi.org/10.1145/265910.265914openalex-snapshot
Sparsification—a technique for speeding up dynamic graph algorithms
inferred← citeshttps://doi.org/10.1145/300515.300517openalex-snapshot
Fully dynamic planarity testing with applications
inferred← citeshttps://doi.org/10.1145/3174803openalex-snapshot
Incremental Exact Min-Cut in Polylogarithmic Amortized Update Time
inferred← citeshttps://doi.org/10.1145/3623271openalex-snapshot
Minimum+1 ( s, t )-cuts and Dual-edge Sensitivity Oracle
inferred← citeshttps://doi.org/10.1145/3717823.3718123openalex-snapshot
Linear-Time Algorithms for k-Edge-Connected Components, k-Lean Tree Decompositions, and More
inferred← citeshttps://doi.org/10.4230/lipics.esa.2016.46openalex-snapshot
Incremental Exact Min-Cut in Poly-logarithmic Amortized Update Time
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.1909.06413openalex-snapshot
Dynamic Graph Algorithms and Graph Sparsification: New Techniques and Connections
inferred← citeshttps://doi.org/10.7936/k7b856cdopenalex-snapshot
A Simple Algorithm For Triconnectivity of a Multigraph
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.