On the public citation graph

2-Edge Connectivity in Directed Graphs

https://doi.org/10.1145/2968448
0 signed · 52 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.1002/dac.612openalex-snapshot
Link‐disjoint paths for reliable QoS routing
inferredcites →https://doi.org/10.1007/978-1-4471-3886-0openalex-snapshot
Digraphs Theory Algorithms And Applications
inferredcites →https://doi.org/10.1007/978-3-319-07959-2_15openalex-snapshot
Loop Nesting Forests, Dominators, and Applications
inferredcites →https://doi.org/10.1007/978-3-642-30850-5_18openalex-snapshot
Computing Strong Articulation Points and Strong Bridges in Large Scale Graphs
inferredcites →https://doi.org/10.1007/978-3-662-47672-7_49openalex-snapshot
2-Vertex Connectivity in Directed Graphs
inferredcites →https://doi.org/10.1007/978-3-662-47672-7_58openalex-snapshot
Finding 2-Edge and 2-Vertex Strongly Connected Components in Quadratic Time
inferredcites →https://doi.org/10.1007/978-3-662-48350-3_49openalex-snapshot
Approximating the Smallest Spanning Subgraph for 2-Edge-Connectivity in Directed Graphs
inferredcites →https://doi.org/10.1007/bf00268499openalex-snapshot
Edge-disjoint spanning trees and depth-first search
inferredcites →https://doi.org/10.1007/bf01099359openalex-snapshot
Bijoin points, bibridges, and biblocks of directed graphs
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.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/0890-5401(88)90016-8openalex-snapshot
The multi-tree approach to reliability in distributed networks
inferredcites →https://doi.org/10.1016/j.dam.2015.10.001openalex-snapshot
On computing the 2-vertex-connected components of directed graphs
inferredcites →https://doi.org/10.1016/j.jda.2013.10.003openalex-snapshot
Finding dominators via disjoint set union
inferredcites →https://doi.org/10.1016/j.tcs.2011.11.011openalex-snapshot
Finding strong bridges and strong articulation points in linear time
inferredcites →https://doi.org/10.1017/cbo9780511721649openalex-snapshot
Algorithmic Aspects of Graph Connectivity
inferredcites →https://doi.org/10.1051/ita/2015001openalex-snapshot
Computing the 2-blocks of directed graphs
inferredcites →https://doi.org/10.1057/jors.1991.155openalex-snapshot
Introduction to Algorithms
inferredcites →https://doi.org/10.1137/0201010openalex-snapshot
Depth-First Search and Linear Graph Algorithms
inferredcites →https://doi.org/10.1137/0203006openalex-snapshot
Finding Dominators in Directed Graphs
inferredcites →https://doi.org/10.1137/070693217openalex-snapshot
Linear-Time Algorithms for Dominators and Other Path-Evaluation Problems
inferredcites →https://doi.org/10.1137/1.9781611973754.15openalex-snapshot
2-Connectivity in Directed Graphs: An Experimental Study
inferredcites →https://doi.org/10.1137/s0097539797317263openalex-snapshot
Dominators in Linear Time
inferredcites →https://doi.org/10.1145/1065887.1065888openalex-snapshot
Corrigendum: a new, simpler linear-time dominators algorithm
inferredcites →https://doi.org/10.1145/2764909openalex-snapshot
The Minset-Poset Approach to Representations of Graph Connectivity
inferredcites →https://doi.org/10.1145/2764913openalex-snapshot
Dominator Tree Certification and Divergent Spanning Trees
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/357062.357071openalex-snapshot
A fast algorithm for finding dominators in a flowgraph
inferredcites →https://doi.org/10.4064/fm-10-1-96-115openalex-snapshot
Zur allgemeinen Kurventheorie
inferredcites →https://doi.org/10.5555/982792.982922openalex-snapshot
Finding dominators revisited: extended abstract

What points at this work

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

inferred← citeshttps://doi.org/10.2139/ssrn.4821442openalex-extracted
On 2-Strong Connectivity Orientations of Mixed Graphs and Related Problems
inferred← citeshttps://doi.org/10.1007/978-3-031-34347-6_18openalex-snapshot
On 2-Strong Connectivity Orientations of Mixed Graphs and Related Problems
inferred← citeshttps://doi.org/10.1007/978-3-032-13562-9_13openalex-snapshot
Strategic Agent-Based Equilibrium Models for Urban Mobility: The Traffic Filter Location Problem
inferred← citeshttps://doi.org/10.1007/978-3-319-77404-6_39openalex-snapshot
Incremental Strong Connectivity and 2-Connectivity in Directed Graphs
inferred← citeshttps://doi.org/10.1007/978-3-662-48054-0openalex-snapshot
Mathematical Foundations of Computer Science 2015
inferred← citeshttps://doi.org/10.1016/j.bulsci.2021.102969openalex-snapshot
2-edge-twinless blocks
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.tcs.2017.06.015openalex-snapshot
Sparse certificates for 2-connectivity in directed graphs
inferred← citeshttps://doi.org/10.1109/focs61266.2024.00015openalex-snapshot
Computing the 3-Edge-Connected Components of Directed Graphs in Linear Time
inferred← citeshttps://doi.org/10.1137/1.9781611974782.124openalex-snapshot
Faster Algorithms for Computing Maximal 2-Connected Subgraphs in Sparse Directed Graphs
inferred← citeshttps://doi.org/10.1137/19m1258530openalex-snapshot
Strong Connectivity in Directed Graphs under Failures, with Applications
inferred← citeshttps://doi.org/10.1145/3055399.3055480openalex-snapshot
Decremental single-source reachability in planar digraphs
inferred← citeshttps://doi.org/10.1145/3077584.3077589openalex-snapshot
What's Inside a Bow-Tie
inferred← citeshttps://doi.org/10.1145/3228332openalex-snapshot
Computing Critical Nodes in Directed Graphs
inferred← citeshttps://doi.org/10.1145/3406325.3451073openalex-snapshot
Subcubic algorithms for Gomory–Hu tree in unweighted graphs
inferred← citeshttps://doi.org/10.1145/3519935.3519945openalex-snapshot
Optimal vertex connectivity oracles
inferred← citeshttps://doi.org/10.1145/3790095openalex-snapshot
Cut Paths and Their Remainder Structure
inferred← citeshttps://doi.org/10.4230/lipics.icalp.2021.105openalex-snapshot
The Structure of Minimum Vertex Cuts
inferred← citeshttps://doi.org/10.4230/lipics.isaac.2020.38openalex-snapshot
Linear-Time Algorithms for Computing Twinless Strong Articulation Points and Related Problems
inferred← citeshttps://doi.org/10.47443/dml.2020.0037openalex-snapshot
Computing 2-twinless blocks
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.2101.02574openalex-snapshot
Planar Reachability Under Single Vertex or Edge Failures
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.