On the public citation graph
Maintaining bridge-connected and biconnected components on-line
0 signed · 140 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-19488-6_143openalex-snapshot
A dynamic data structure for planar graph embedding
inferredcites →https://doi.org/10.1007/bfb0032061openalex-snapshot
On-line graph algorithms with SPQR-trees
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/0022-0000(79)90042-4openalex-snapshot
A class of algorithms which require nonlinear time to maintain disjoint sets
inferredcites →https://doi.org/10.1016/0022-0000(83)90006-5openalex-snapshot
A data structure for dynamic trees
inferredcites →https://doi.org/10.1016/b978-0-444-88071-0.50022-9openalex-snapshot
Parallel Algorithms for Shared-Memory Machines
inferredcites →https://doi.org/10.1109/sfcs.1989.63515openalex-snapshot
Incremental planarity testing
inferredcites →https://doi.org/10.1109/tc.1987.1676869openalex-snapshot
New Connectivity and MSF Algorithms for Shuffle-Exchange Network and PRAM
inferredcites →https://doi.org/10.1137/0201010openalex-snapshot
Depth-First Search and Linear Graph Algorithms
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.1137/0215072openalex-snapshot
On the Single-Operation Worst-Case Time Complexity of the Disjoint Set Union Problem
inferredcites →https://doi.org/10.1137/1.9781611970265openalex-snapshot
Data Structures and Network Algorithms
inferredcites →https://doi.org/10.1145/100216.100221openalex-snapshot
Lower bounds for the union-find and the split-find problem on pointer machines
inferredcites →https://doi.org/10.1145/321879.321884openalex-snapshot
Efficiency of a Good But Not Linear Set Union Algorithm
inferredcites →https://doi.org/10.1145/322234.322235openalex-snapshot
An On-Line Edge-Deletion Problem
inferredcites →https://doi.org/10.1145/362248.362272openalex-snapshot
Algorithm 447: efficient algorithms for graph manipulation
inferredcites →https://doi.org/10.1145/62.2160openalex-snapshot
Worst-case Analysis of Set Union Algorithms
inferredcites →https://doi.org/10.1145/73007.73040openalex-snapshot
The cell probe complexity of dynamic data structures
inferredcites →https://doi.org/10.21236/ada201173openalex-snapshot
Dynamic Data Structures for Two-Dimensional Searching
inferredcites →https://doi.org/10.21236/ada215107openalex-snapshot
Maintaining Bridge-Connected and Biconnected Components On-Line
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/cpe.6650openalex-snapshot
Efficient parallel algorithms for dynamic closeness‐ and betweenness centrality
inferred← citeshttps://doi.org/10.1002/net.21450openalex-snapshot
Real‐time monitoring of undirected networks: Articulation points, bridges, and connected and biconnected components
inferred← citeshttps://doi.org/10.1006/jagm.1996.0044openalex-snapshot
On-line Planar Graph Embedding
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/11889205_13openalex-snapshot
The Minimum Spanning Tree Constraint
inferred← citeshttps://doi.org/10.1007/3-540-36563-x_20openalex-snapshot
Authenticated Data Structures for Graph and Geometric Searching
inferred← citeshttps://doi.org/10.1007/3-540-36563-x_21openalex-snapshot
Fractal Merkle Tree Representation and Traversal
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-44985-x_6openalex-snapshot
Maintaining Center and Median in Dynamic Trees
inferred← citeshttps://doi.org/10.1007/3-540-54233-7_146openalex-snapshot
Maintaining biconnected components of dynamic planar graphs
inferred← citeshttps://doi.org/10.1007/3-540-55706-7_19openalex-snapshot
Dynamic 2- and 3-connectivity on planar graphs
inferred← citeshttps://doi.org/10.1007/3-540-55719-9_87openalex-snapshot
Maintenance of triconnected components of graphs
inferred← citeshttps://doi.org/10.1007/3-540-56402-0_45openalex-snapshot
On assembly of four-connected graphs
inferred← citeshttps://doi.org/10.1007/3-540-57273-2_47openalex-snapshot
Combine and conquer: A general technique for dynamic algorithms
inferred← citeshttps://doi.org/10.1007/3-540-60084-1_81openalex-snapshot
Approximating minimum cuts under insertions
inferred← citeshttps://doi.org/10.1007/3-540-60313-1_142openalex-snapshot
Certificates and fast algorithms for biconnectivity in fully-dynamic graphs
inferred← citeshttps://doi.org/10.1007/3-540-61332-3_141openalex-snapshot
Output-sensitive reporting of disjoint paths (extended abstract)
inferred← citeshttps://doi.org/10.1007/3-540-63397-9_25openalex-snapshot
Quasi-fully dynamic algorithms for two-connectivity, cycle equivalence and related problems
inferred← citeshttps://doi.org/10.1007/4-431-35881-1_1openalex-snapshot
A Distributed Biconnectivity Check
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-21571-2_8openalex-snapshot
Articulation of Transition Systems and Its Application to Petri Net Synthesis
inferred← citeshttps://doi.org/10.1007/978-3-030-35802-0_2openalex-snapshot
Representing Graphs and Hypergraphs by Touching Polygons in 3D
inferred← citeshttps://doi.org/10.1007/978-3-319-29516-9_13openalex-snapshot
Dynamic Subtrees Queries Revisited: The Depth First Tour Tree
inferred← citeshttps://doi.org/10.1007/978-3-540-78153-0_4openalex-snapshot
Topology-Aware Replica Placement in Fault-Tolerant Embedded Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-10217-2_29openalex-snapshot
Planar Biconnectivity Augmentation with Fixed Embedding
inferred← citeshttps://doi.org/10.1007/bf01189067openalex-snapshot
Fully dynamic biconnectivity in graphs
inferred← citeshttps://doi.org/10.1007/bf01955676openalex-snapshot
Decremental 2- and 3-connectivity on planar graphs
inferred← citeshttps://doi.org/10.1007/bf01961541openalex-snapshot
On-Line Maintenance of Triconnected Components with SPQR-Trees
inferred← citeshttps://doi.org/10.1007/bfb0020437openalex-snapshot
An incremental distributed algorithm for computing biconnected components
inferred← citeshttps://doi.org/10.1007/pl00009220openalex-snapshot
On Certificates and Lookahead in Dynamic Graph Problems
inferred← citeshttps://doi.org/10.1007/pl00009226openalex-snapshot
An Incremental Distributed Algorithm for Computing Biconnected Components in Dynamic Graphs
inferred← citeshttps://doi.org/10.1007/pl00009228openalex-snapshot
Lower Bounds for Fully Dynamic Connectivity Problems in Graphs
inferred← citeshttps://doi.org/10.1007/s00453-001-0108-5openalex-snapshot
Quasi-Fully Dynamic Algorithms for Two-Connectivity and Cycle Equivalence
inferred← citeshttps://doi.org/10.1007/s00453-003-1055-0openalex-snapshot
Disk Embeddings of Planar Graphs
inferred← citeshttps://doi.org/10.1007/s00453-009-9355-7openalex-snapshot
Efficient Authenticated Data Structures for Graph Connectivity and Geometric Search Problems
inferred← citeshttps://doi.org/10.1007/s10115-022-01681-wopenalex-snapshot
A survey on mining and analysis of uncertain graphs
inferred← citeshttps://doi.org/10.1007/s10458-016-9343-7openalex-snapshot
The joint movement of pebbles in solving the ( $$N^2-1$$ N 2 - 1 )-puzzle suboptimally and its applications in rule-based cooperative path-finding
inferred← citeshttps://doi.org/10.1007/s11280-013-0204-xopenalex-snapshot
Mining most frequently changing component in evolving graphs
inferred← citeshttps://doi.org/10.1007/s13278-014-0220-6openalex-snapshot
Efficient algorithms for incremental all pairs shortest paths, closeness and betweenness in social network analysis
inferred← citeshttps://doi.org/10.1007/s40840-019-00868-9openalex-snapshot
Two Sufficient Conditions for 2-Connected Graphs to Have Proper Connection Number 2
inferred← citeshttps://doi.org/10.1016/0012-365x(93)90376-5openalex-snapshot
Maintenance of 2- and 3-edge- connected components of graphs I
inferred← citeshttps://doi.org/10.1016/0020-0190(95)00000-3openalex-snapshot
Linear bounds for on-line Steiner problems
inferred← citeshttps://doi.org/10.1016/j.disopt.2024.100823openalex-snapshot
Parametric matroid interdiction
inferred← citeshttps://doi.org/10.1016/j.ic.2018.02.007openalex-snapshot
2-vertex connectivity in directed graphs
inferred← citeshttps://doi.org/10.1016/j.ipl.2007.11.020openalex-snapshot
Dynamic bottleneck optimization for k-edge and 2-vertex connectivity
inferred← citeshttps://doi.org/10.1023/a:1009746026508openalex-snapshot
A Unifying Augmentation Algorithm for Two-Edge Connectivity and Biconnectivity
inferred← citeshttps://doi.org/10.1080/1062936x.2011.645873openalex-snapshot
Simulation of chemical metabolism for fate and hazard assessment. IV. Computer-based derivation of metabolic simulators from documented metabolism maps
inferred← citeshttps://doi.org/10.1093/bioinformatics/btac238openalex-snapshot
CALDERA: finding all significant de Bruijn subgraphs for bacterial GWAS
inferred← citeshttps://doi.org/10.1093/bioinformatics/btr562openalex-snapshot
Fast scaffolding with small independent mixed integer programs
inferred← citeshttps://doi.org/10.1103/physreve.110.014122openalex-snapshot
Emergence of biconnected clusters in explosive percolation
inferred← citeshttps://doi.org/10.1103/physreve.87.022804openalex-snapshot
Phase transition in the biconnectivity of scale-free networks
inferred← citeshttps://doi.org/10.1103/physrevlett.100.138701openalex-snapshot
Bicomponents and the Robustness of Networks to Failure
inferred← citeshttps://doi.org/10.1109/71.946661openalex-snapshot
Fully dynamic maintenance of k-connectivity in parallel
inferred← citeshttps://doi.org/10.1109/asonam.2012.197openalex-snapshot
An Efficient Map-Reduce Algorithm for the Incremental Computation of All-Pairs Shortest Paths in Social Networks
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/focs52979.2021.00088openalex-snapshot
Fully Dynamic s-t Edge Connectivity in Subpolynomial Time (Extended Abstract)
inferred← citeshttps://doi.org/10.1109/hipc.2014.7116914openalex-snapshot
Simple parallel biconnectivity algorithms for multicore platforms
inferred← citeshttps://doi.org/10.1109/icde65448.2025.00019openalex-snapshot
Preserving K-Connectivity in Dynamic Graphs
inferred← citeshttps://doi.org/10.1109/icdm.2013.106openalex-snapshot
Mining Evolving Network Processes
inferred← citeshttps://doi.org/10.1109/iiai-aai.2013.78openalex-snapshot
Structure-based Data Mining and Screening for Network Traffic Data
inferred← citeshttps://doi.org/10.1109/ispa-bdcloud-socialcom-sustaincom57177.2022.00103openalex-snapshot
Best Community Discovery on Dynamic Social Networks
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/sfcs.1991.185429openalex-snapshot
Ambivalent data structures for dynamic 2-edge-connectivity and k smallest spanning trees
inferred← citeshttps://doi.org/10.1109/sfcs.1992.267818openalex-snapshot
Sparsification-a technique for speeding up dynamic graph algorithms
inferred← citeshttps://doi.org/10.1109/sfcs.1992.267819openalex-snapshot
Fully dynamic biconnectivity in graphs
inferred← citeshttps://doi.org/10.1109/spdp.1995.530687openalex-snapshot
Fully dynamic maintaining 2-edge connectivity in parallel
inferred← citeshttps://doi.org/10.1109/tkde.2015.2445756openalex-snapshot
Capacity-Constrained Network-Voronoi Diagram
inferred← citeshttps://doi.org/10.1109/tkde.2017.2780123openalex-snapshot
Efficient Information Flow Maximization in Probabilistic Graphs
inferred← citeshttps://doi.org/10.1111/coin.12002openalex-snapshot
SOLVING ABSTRACT COOPERATIVE PATH‐FINDING IN DENSELY POPULATED ENVIRONMENTS
inferred← citeshttps://doi.org/10.1137/0221062openalex-snapshot
Fully Dynamic Algorithms for 2-Edge Connectivity
inferred← citeshttps://doi.org/10.1137/0222002openalex-snapshot
Maintaining the 3-Edge-Connected Components of a Graph On-Line
inferred← citeshttps://doi.org/10.1137/1.9781611973730.132openalex-snapshot
2-Edge Connectivity in Directed Graphs
inferred← citeshttps://doi.org/10.1137/1.9781611974782.31openalex-snapshot
Connectivity Oracles for Graphs Subject to Vertex Failures
inferred← citeshttps://doi.org/10.1137/16m1106225openalex-snapshot
Algorithms for Weighted Matching Generalizations II: f -factors and the Special Case of Shortest Paths
inferred← citeshttps://doi.org/10.1137/17m1146610openalex-snapshot
Connectivity Oracles for Graphs Subject to Vertex Failures
inferred← citeshttps://doi.org/10.1137/19m1258530openalex-snapshot
Strong Connectivity in Directed Graphs under Failures, with Applications
inferred← citeshttps://doi.org/10.1137/s0097539792226825openalex-snapshot
Ambivalent Data Structures for Dynamic 2-Edge-Connectivity and k Smallest Spanning Trees
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.1142/s0218213013600026openalex-snapshot
REDUNDANCY ELIMINATION IN HIGHLY PARALLEL SOLUTIONS OF MOTION COORDINATION PROBLEMS
inferred← citeshttps://doi.org/10.1145/1103963.1103966openalex-snapshot
Maintaining information in fully dynamic trees with top trees
inferred← citeshttps://doi.org/10.1145/116873.116878openalex-snapshot
Data structures and algorithms for disjoint set union problems
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/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/276698.276715openalex-snapshot
Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity
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.1145/3717823.3718270openalex-snapshot
Fully Dynamic Biconnectivity in Õ(log² n) Time
inferred← citeshttps://doi.org/10.1145/3735106openalex-snapshot
Proceedings of the 19th International Symposium on Database Programming Languages
inferred← citeshttps://doi.org/10.1145/3735106.3736536openalex-snapshot
Efficient Enumeration of the Complete Join Search Space
inferred← citeshttps://doi.org/10.1145/3802084openalex-snapshot
Maintaining Biconnected Components in Streaming Graphs
inferred← citeshttps://doi.org/10.1145/502090.502095openalex-snapshot
Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity
inferred← citeshttps://doi.org/10.1201/b15385-20openalex-snapshot
- The Open Graph Drawing Framework (OGDF)
inferred← citeshttps://doi.org/10.1609/socs.v15i1.21752openalex-snapshot
Generalized Longest Path Problems
inferred← citeshttps://doi.org/10.2172/93769openalex-snapshot
On certificates and lookahead in dynamic graph problems
inferred← citeshttps://doi.org/10.3233/fi-2014-1123openalex-snapshot
The Impact of a Bi-connected Graph Decomposition on Solving Cooperative Path-finding Problems
inferred← citeshttps://doi.org/10.3233/fi-2015-1192openalex-snapshot
On the Complexity of Optimal Parallel Cooperative Path-Finding
inferred← citeshttps://doi.org/10.3233/fi-2021-2080openalex-snapshot
Articulations and Products of Transition Systems and their Applications to Petri Net Synthesis
inferred← citeshttps://doi.org/10.48550/arxiv.1504.00341openalex-snapshot
A linear time algorithm to compute the impact of all the articulation points
inferred← citeshttps://doi.org/10.48550/arxiv.1511.02913openalex-snapshot
Strong Connectivity in Directed Graphs under Failures, with Application
inferred← citeshttps://doi.org/10.48550/arxiv.2105.05234openalex-snapshot
A Spectral Representation of Power Systems with Applications to Adaptive Grid Partitioning and Cascading Failure Localization
inferred← citeshttps://doi.org/10.5555/127787.127824openalex-snapshot
On finding minimal 2-connected subgraphs
inferred← citeshttps://doi.org/10.5555/2263019.2263068openalex-snapshot
Simulating large-scale dynamic random graphs in OMNeT++
inferred← citeshttps://doi.org/10.5555/2722129.2722261openalex-snapshot
2-edge connectivity in directed graphs
inferred← citeshttps://doi.org/10.5555/313651.313711openalex-snapshot
Locally orientable graphs, cell structures, and a new algorithm for the incremental maintenance of connectivity carcasses
inferred← citeshttps://doi.org/10.5555/313852.313922openalex-snapshot
An empirical study of dynamic graph algorithms
inferred← citeshttps://doi.org/10.5555/313852.314067openalex-snapshot
On certificates and lookahead in dynamic graph problems
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.