On the public citation graph

Representing and enumerating edge connectivity cuts in RNC

https://doi.org/10.1007/bfb0028269
0 signed · 48 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/net.1975.5.3.253openalex-snapshot
The Minimum Number of Edges and Vertices in a Graph with Edge Connectivity n and m n‐Bonds
inferredcites →https://doi.org/10.1002/net.3230140211openalex-snapshot
On computing the connectivities of graphs and digraphs
inferredcites →https://doi.org/10.1002/net.3230180102openalex-snapshot
Bounding all‐terminal reliability in computer networks
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/bf01581031openalex-snapshot
On the structure of all minimum cuts in a network and applications
inferredcites →https://doi.org/10.1007/bf02579206openalex-snapshot
Matching is as easy as matrix inversion
inferredcites →https://doi.org/10.1007/bf02579407openalex-snapshot
Constructing a perfect matching is in random NC
inferredcites →https://doi.org/10.1007/bfb0120902openalex-snapshot
On the structure of all minimum cuts in a network and applications
inferredcites →https://doi.org/10.1080/03155986.1982.11731876openalex-snapshot
Selected Applications of Minimum Cuts in Networks
inferredcites →https://doi.org/10.1109/fscs.1990.89592openalex-snapshot
A fast algorithm for optimally increasing the edge-connectivity
inferredcites →https://doi.org/10.1109/sfcs.1987.19openalex-snapshot
Determining edge connectivity in 0(nm)
inferredcites →https://doi.org/10.1137/0204043openalex-snapshot
Network Flow and Testing Graph Connectivity
inferredcites →https://doi.org/10.1145/103418.103436openalex-snapshot
A matroid approach to finding edge connectivity and packing arborescences
inferredcites →https://doi.org/10.1145/28395.383347openalex-snapshot
Matching is as easy as matrix inversion
inferredcites →https://doi.org/10.5555/320176.320227openalex-snapshot
On the number of minimum size separating vertex sets in a graph and how to find all of them

What points at this work

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

inferred← citeshttps://doi.org/10.1002/net.3230240804openalex-snapshot
An exact lower bound on the number of cut‐sets in multigraphs
inferred← citeshttps://doi.org/10.1006/jagm.1999.1039openalex-snapshot
Building Chain and Cactus Representations of All Minimum Cuts from Hao–Orlin in the Same Asymptotic Run Time
inferred← citeshttps://doi.org/10.1007/3-540-45655-4_25openalex-snapshot
On the Number of Minimum Cuts in a Graph
inferred← citeshttps://doi.org/10.1007/3-540-47867-1_9openalex-snapshot
A New Approach to Cactus Construction Applied to TSP Support Graphs
inferred← citeshttps://doi.org/10.1007/3-540-55719-9_88openalex-snapshot
Suboptimal cuts: Their enumeration, weight and number
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-61310-2_35openalex-snapshot
Separating maximally violated comb inequalities in planar graphs
inferred← citeshttps://doi.org/10.1007/3-540-69346-7_23openalex-snapshot
Building Chain and Cactus Representations of All Minimum Cuts from Hao-Orlin in the Same Asymptotic Run Time
inferred← citeshttps://doi.org/10.1007/978-3-540-85221-6_3openalex-snapshot
Deformable Polygon Representation and Near-Mincuts
inferred← citeshttps://doi.org/10.1007/bf03167227openalex-snapshot
Canonical cactus representation for minimum cuts
inferred← citeshttps://doi.org/10.1007/bf03167346openalex-snapshot
A fast algorithm for cactus representations of minimum cuts
inferred← citeshttps://doi.org/10.1007/s101070050042openalex-snapshot
Parallel and fast sequential algorithms for undirected edge connectivity augmentation
inferred← citeshttps://doi.org/10.1016/j.dam.2007.03.022openalex-snapshot
Computing finest mincut partitions of a graph and application to routing problems
inferred← citeshttps://doi.org/10.1016/j.disopt.2009.07.001openalex-snapshot
Generating partitions of a graph into a fixed number of minimum weight cuts
inferred← citeshttps://doi.org/10.1109/ispan.1999.778954openalex-snapshot
An NC approximation algorithm for optimal k-edge connectivity augmentation
inferred← citeshttps://doi.org/10.1109/tnet.2008.2009062openalex-snapshot
On Conflict-Free All-to-All Broadcast in One-Hop Optical Networks of Arbitrary Topologies
inferred← citeshttps://doi.org/10.1137/1.9781611977042.2openalex-snapshot
Practical Fully Dynamic Minimum Cut Algorithms
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.1137/s0895480103427138openalex-snapshot
On the Number of Minimum Cuts in a Graph
inferred← citeshttps://doi.org/10.1142/s0218196714500076openalex-snapshot
A CACTUS THEOREM FOR END CUTS
inferred← citeshttps://doi.org/10.1145/167088.167281openalex-snapshot
An Õ(n 2 ) algorithm for minimum cuts
inferred← citeshttps://doi.org/10.1145/195058.195425openalex-snapshot
Augmenting undirected connectivity in RNC and in randomized Õ(n3) time
inferred← citeshttps://doi.org/10.1145/234533.234534openalex-snapshot
A new approach to the minimum cut problem
inferred← citeshttps://doi.org/10.1287/moor.24.1.130openalex-snapshot
Separating Maximally Violated Comb Inequalities in Planar Graphs
inferred← citeshttps://doi.org/10.15807/jorsj.39.135openalex-snapshot
CONSTRUCTING CACTUS REPRESENTATION FOR ALL MINIMUM CUTS IN AN UNDIRECTED NETWORK
inferred← citeshttps://doi.org/10.15807/jorsj.47.199openalex-snapshot
GRAPH ALGORITHMS FOR NETWORK CONNECTIVITY PROBLEMS( Network Design, Control and Optimization)
inferred← citeshttps://doi.org/10.2140/agt.2011.11.2547openalex-snapshot
The cactus tree of a metric space
inferred← citeshttps://doi.org/10.31390/gradschool_dissertations.3798openalex-snapshot
Optical control plane: theory and algorithms
inferred← citeshttps://doi.org/10.4230/lipics.esa.2020.59openalex-snapshot
Finding All Global Minimum Cuts In Practice
inferred← citeshttps://doi.org/10.48550/arxiv.1711.03165openalex-snapshot
Computing exact minimum cuts without knowing the graph
inferred← citeshttps://doi.org/10.48550/arxiv.2108.04566openalex-snapshot
Algorithm Engineering for Cut Problems
inferred← citeshttps://doi.org/10.5555/1496770.1496798openalex-snapshot
A near-linear time algorithm for constructing a cactus representation of minimum cuts
inferred← citeshttps://doi.org/10.5555/313559.313605openalex-snapshot
Global min-cuts in RNC, and other ramifications of a simple min-cut algorithm
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.