On the public citation graph

A fast algorithm for cactus representations of minimum cuts

https://doi.org/10.1007/bf03167346
0 signed · 34 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-69346-7_23openalex-snapshot
Building Chain and Cactus Representations of All Minimum Cuts from Hao-Orlin in the Same Asymptotic Run Time
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/bf03167227openalex-snapshot
Canonical cactus representation for minimum cuts
inferredcites →https://doi.org/10.1007/bfb0028269openalex-snapshot
Representing and enumerating edge connectivity cuts in RNC
inferredcites →https://doi.org/10.1007/bfb0049404openalex-snapshot
A simple min cut algorithm
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.1007/s004539910004openalex-snapshot
A Simplified Õ(nm) Time Edge-Splitting Algorithm in Undirected Graphs
inferredcites →https://doi.org/10.1016/c2009-0-09109-0openalex-snapshot
Combinatorial Problems and Exercises
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.1137/0405004openalex-snapshot
Computing Edge-Connectivity in Multigraphs and Capacitated Graphs
inferredcites →https://doi.org/10.1137/s0097539792234226openalex-snapshot
A Fast Algorithm for Optimally Increasing the Edge Connectivity
inferredcites →https://doi.org/10.1137/s0895480193243274openalex-snapshot
Data Security Equals Graph Connectivity
inferredcites →https://doi.org/10.1145/195058.195425openalex-snapshot
Augmenting undirected connectivity in RNC and in randomized Õ(n3) time
inferredcites →https://doi.org/10.15807/jorsj.39.135openalex-snapshot
CONSTRUCTING CACTUS REPRESENTATION FOR ALL MINIMUM CUTS IN AN UNDIRECTED NETWORK
inferredcites →https://doi.org/10.5555/313559.313753openalex-snapshot
A representation for crossing set families with applications to submodular flow problems

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.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-47867-1_9openalex-snapshot
A New Approach to Cactus Construction Applied to TSP Support Graphs
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/s00453-011-9551-0openalex-snapshot
Augmenting the Edge Connectivity of Planar Straight Line Graphs to Three
inferred← citeshttps://doi.org/10.1016/j.cosrev.2025.100867openalex-snapshot
Interdiction in network maximum flow and related problems: A survey
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.dam.2008.06.031openalex-snapshot
Phylogenetic graph models beyond trees
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.1016/s0166-218x(01)00349-3openalex-snapshot
Graph connectivity and its augmentation: applications of MA orderings
inferred← citeshttps://doi.org/10.1016/s0166-218x(02)00218-4openalex-snapshot
An approximation for finding a smallest 2-edge-connected subgraph containing a specified spanning tree
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.1145/2764909openalex-snapshot
The Minset-Poset Approach to Representations of Graph Connectivity
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.47.199openalex-snapshot
GRAPH ALGORITHMS FOR NETWORK CONNECTIVITY PROBLEMS( Network Design, Control and Optimization)
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.2108.04566openalex-snapshot
Algorithm Engineering for Cut 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.