On the public citation graph

Maintaining the Classes of 4-Edge-Connectivity in a Graph On-Line

0 signed · 51 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-55719-9_86openalex-snapshot

Fast incremental planarity testing

inferredcites →https://doi.org/10.1007/3-540-55719-9_87openalex-snapshot

Maintenance of triconnected components of graphs

inferredcites →https://doi.org/10.1007/3-540-60084-1_81openalex-snapshot

Approximating minimum cuts under insertions

inferredcites →https://doi.org/10.1007/bf01758778openalex-snapshot

A linear-time algorithm for finding a sparsek-connected spanning subgraph of ak-connected graph

inferredcites →https://doi.org/10.1007/bf03167227openalex-snapshot

Canonical cactus representation for minimum cuts

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.1057/jors.1991.155openalex-snapshot

Introduction to Algorithms

inferredcites →https://doi.org/10.1109/istcs.1993.253480openalex-snapshot

Maintaining the 4-edge-connected components of a graph on-line

inferredcites →https://doi.org/10.1109/sfcs.1991.185453openalex-snapshot

Applications of a poset representation to edge connectivity and graph rigidity

inferredcites →https://doi.org/10.1109/sfcs.1992.267818openalex-snapshot

Sparsification-a technique for speeding up dynamic graph algorithms

inferredcites →https://doi.org/10.1137/0109047openalex-snapshot

Multi-Terminal Network Flows

inferredcites →https://doi.org/10.1137/0202012openalex-snapshot

Dividing a Graph into Triconnected Components

inferredcites →https://doi.org/10.1145/122413.122416openalex-snapshot

Reducing edge connectivity to vertex connectivity

inferredcites →https://doi.org/10.1145/195058.195442openalex-snapshot

The connectivity carcass of a vertex subset in a graph and its incremental maintenance

inferredcites →https://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

inferredcites →https://doi.org/10.1145/3828.3835openalex-snapshot

Self-adjusting binary search trees

inferredcites →https://doi.org/10.1145/62.2160openalex-snapshot

Worst-case Analysis of Set Union Algorithms

inferredcites →https://doi.org/10.3138/9781487584863openalex-snapshot

Connectivity in Graphs

inferredcites →https://doi.org/10.5555/314464.314582openalex-snapshot

Using randomized sparsification to approximate minimum cuts

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11604686_28openalex-snapshot

Finding Disjoint Paths on Directed Acyclic Graphs

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/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-031-25211-2_18openalex-snapshot

Some Insights on Dynamic Maintenance of Gomory-Hu Tree in Cactus Graphs and General Graphs

inferred← citeshttps://doi.org/10.1007/978-3-031-49815-2_14openalex-snapshot

Improved Approximations for Relative Survivable Network Design

inferred← citeshttps://doi.org/10.1007/978-3-540-24749-4_31openalex-snapshot

Solving the 2-Disjoint Paths Problem in Nearly Linear Time

inferred← citeshttps://doi.org/10.1007/s00224-005-1256-9openalex-snapshot

Solving the 2-Disjoint Paths Problem in Nearly Linear Time

inferred← citeshttps://doi.org/10.1007/s00453-001-0078-7openalex-snapshot

Property Testing in Bounded Degree 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.1016/j.tcs.2012.09.025openalex-snapshot

Linear time algorithms for two disjoint paths problems on directed acyclic graphs

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.1137/1.9781611974782.31openalex-snapshot

Connectivity Oracles for Graphs Subject to Vertex Failures

inferred← citeshttps://doi.org/10.1137/1.9781611976465.74openalex-snapshot

Vertex Sparsification for Edge Connectivity

inferred← citeshttps://doi.org/10.1137/1.9781611977073.27openalex-snapshot

Sensitivity Oracles for All-Pairs Mincuts

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/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/258533.258627openalex-snapshot

Property testing in bounded degree graphs

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.1145/3757919openalex-snapshot

Computing the 4-Edge-Connected Components of a Graph: An Experimental Study

inferred← citeshttps://doi.org/10.1145/780542.780568openalex-snapshot

A fast algorithm for computing steiner edge connectivity

inferred← citeshttps://doi.org/10.1561/0400000029openalex-snapshot

Algorithmic and Analysis Techniques in Property Testing

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.esa.2021.47openalex-snapshot

Computing the $4$-Edge-Connected Components of a Graph in Linear Time

inferred← citeshttps://doi.org/10.4230/lipics.esa.2021.71openalex-snapshot

Determining 4-Edge-Connected Components in Linear Time

inferred← citeshttps://doi.org/10.4230/lipics.esa.2022.60openalex-snapshot

Computing the 4-Edge-Connected Components of a Graph: An Experimental Study

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.48550/arxiv.1910.10359openalex-snapshot

Vertex Sparsifiers for c-Edge Connectivity

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.