On the public citation graph

Efficient algorithm for finding all minimal edge cuts of a nonoriented graph

https://doi.org/10.1007/bf01074775
0 signed · 84 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 points at this work

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

inferred← citeshttps://doi.org/10.1002/9780470400531.eorms0509openalex-snapshot
Maximum Flow Algorithms
inferred← citeshttps://doi.org/10.1002/net.21975openalex-snapshot
The firebreak problem
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.1993.1010openalex-snapshot
Approximation Algorithms for Graph Augmentation
inferred← citeshttps://doi.org/10.1006/jagm.1996.0052openalex-snapshot
Improved Approximation Algorithms for Uniform Connectivity Problems
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-44929-9_14openalex-snapshot
The (σ + 1)-Edge-Connectivity Augmentation Problem without Creating Multiple Edges of 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_85openalex-snapshot
Approximation algorithms for graph augmentation
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-56279-6_55openalex-snapshot
The k-edge-connectivity augmentation problem of weighted graphs
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-58325-4_184openalex-snapshot
Minimum augmentation to k-edge-connect specified vertices of 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-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-031-01860-2openalex-snapshot
On Uncertain Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-30480-7_13openalex-snapshot
Extraction of Cognitively-Significant Place Names and Regions from Web-Based Physical Proximity Co-occurrences
inferred← citeshttps://doi.org/10.1007/978-3-540-69733-6_43openalex-snapshot
Efficient Algorithms for the k Smallest Cuts Enumeration
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/978-3-642-37186-8_2openalex-snapshot
Mining Graphs of Prescribed Connectivity
inferred← citeshttps://doi.org/10.1007/bf01908632openalex-snapshot
Extracting maximal information about sets of minimum cuts
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/bf03167564openalex-snapshot
A linear time algorithm for computing 3-edge-connected components in a multigraph
inferred← citeshttps://doi.org/10.1007/bfb0028269openalex-snapshot
Representing and enumerating edge connectivity cuts in RNC
inferred← citeshttps://doi.org/10.1007/s00453-009-9284-5openalex-snapshot
Efficient Algorithms for the Problems of Enumerating Cuts by Non-decreasing Weights
inferred← citeshttps://doi.org/10.1007/s00778-014-0373-yopenalex-snapshot
Graph similarity search on large uncertain graph databases
inferred← citeshttps://doi.org/10.1007/s101070050042openalex-snapshot
Parallel and fast sequential algorithms for undirected edge connectivity augmentation
inferred← citeshttps://doi.org/10.1007/s101070100275openalex-snapshot
Efficient separation routines for the symmetric traveling salesman problem I: general tools and comb separation
inferred← citeshttps://doi.org/10.1016/0166-218x(95)00043-qopenalex-snapshot
Graphs with largest number of minimum cuts
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.2021.04.005openalex-snapshot
Game edge-connectivity of graphs
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(02)00501-2openalex-snapshot
Characterizing the flow equivalent trees of a network
inferred← citeshttps://doi.org/10.1017/9781316888568openalex-snapshot
Network Flow Algorithms
inferred← citeshttps://doi.org/10.1017/9781316888568.001openalex-snapshot
Preface
inferred← citeshttps://doi.org/10.1017/9781316888568.002openalex-snapshot
Acknowledgements
inferred← citeshttps://doi.org/10.1017/9781316888568.003openalex-snapshot
Preliminaries: Shortest Path Algorithms
inferred← citeshttps://doi.org/10.1017/9781316888568.004openalex-snapshot
Maximum Flow Algorithms
inferred← citeshttps://doi.org/10.1017/9781316888568.005openalex-snapshot
Global Minimum Cut Algorithms
inferred← citeshttps://doi.org/10.1017/9781316888568.006openalex-snapshot
More Maximum Flow Algorithms
inferred← citeshttps://doi.org/10.1017/9781316888568.007openalex-snapshot
Minimum-Cost Circulation Algorithms
inferred← citeshttps://doi.org/10.1017/9781316888568.008openalex-snapshot
Generalized Flow Algorithms
inferred← citeshttps://doi.org/10.1017/9781316888568.009openalex-snapshot
Multicommodity Flow Algorithms
inferred← citeshttps://doi.org/10.1017/9781316888568.010openalex-snapshot
Electrical Flow Algorithms
inferred← citeshttps://doi.org/10.1017/9781316888568.011openalex-snapshot
Open Questions
inferred← citeshttps://doi.org/10.1017/9781316888568.012openalex-snapshot
Author Index
inferred← citeshttps://doi.org/10.1017/9781316888568.013openalex-snapshot
Index
inferred← citeshttps://doi.org/10.1109/commnet49926.2020.9199616openalex-snapshot
New and efficient method to find all minimal paths
inferred← citeshttps://doi.org/10.1109/fscs.1990.89592openalex-snapshot
A fast algorithm for optimally increasing the edge-connectivity
inferred← citeshttps://doi.org/10.1109/iscas.1993.394287openalex-snapshot
Approximation algorithms for minimum-cost augmentation to k-edge-connect a multigraph
inferred← citeshttps://doi.org/10.1109/iscas.1995.521474openalex-snapshot
Approximation algorithms for the k-edge-connectivity augmentation problem
inferred← citeshttps://doi.org/10.1109/iscas.2000.858823openalex-snapshot
k-edge-connectivity augmentation problem with upper bounds on edge multiplicity
inferred← citeshttps://doi.org/10.1109/iscas.2003.1204999openalex-snapshot
A 2-approximation algorithm FSA+1 to (λ+1)-edge-connect a specified set of vertices in a λ-edge-connected graph
inferred← citeshttps://doi.org/10.1109/iscas.2005.1465066openalex-snapshot
Maximum Weight Matching-Based Algorithms for k-Edge-Connectivity Augmentation of a Graph
inferred← citeshttps://doi.org/10.1109/sfcs.1991.185453openalex-snapshot
Applications of a poset representation to edge connectivity and graph rigidity
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.1109/wcica.2006.1712583openalex-snapshot
City Transportation Network System Optimization Model and Its Algorithms
inferred← citeshttps://doi.org/10.1109/wicom.2007.1603openalex-snapshot
Two Phases Algorithm of Transport Network Design Problem
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.9781611977042.2openalex-snapshot
Practical Fully Dynamic Minimum Cut Algorithms
inferred← citeshttps://doi.org/10.1137/s0097539794269072openalex-snapshot
Separator-Based Sparsification II: Edge and Vertex Connectivity
inferred← citeshttps://doi.org/10.1145/103418.103436openalex-snapshot
A matroid approach to finding edge connectivity and packing arborescences
inferred← citeshttps://doi.org/10.1145/167088.167152openalex-snapshot
Reinventing the wheel
inferred← citeshttps://doi.org/10.1145/167088.167159openalex-snapshot
Separator based sparsification for dynamic planar graph algorithms
inferred← citeshttps://doi.org/10.1145/167088.167281openalex-snapshot
An Õ(n 2 ) algorithm for minimum cuts
inferred← citeshttps://doi.org/10.1145/225058.225066openalex-snapshot
Improved approximation algorithms for uniform connectivity problems
inferred← citeshttps://doi.org/10.1145/234533.234534openalex-snapshot
A new approach to the minimum cut problem
inferred← citeshttps://doi.org/10.1145/2746539.2746588openalex-snapshot
Deterministic Global Minimum Cut of a Simple Graph in Near-Linear Time
inferred← citeshttps://doi.org/10.1145/2764909openalex-snapshot
The Minset-Poset Approach to Representations of Graph Connectivity
inferred← citeshttps://doi.org/10.1145/3274663openalex-snapshot
Deterministic Edge Connectivity in Near-Linear Time
inferred← citeshttps://doi.org/10.1287/moor.24.1.130openalex-snapshot
Separating Maximally Violated Comb Inequalities in Planar Graphs
inferred← citeshttps://doi.org/10.14778/2311906.2311908openalex-snapshot
Efficient subgraph similarity search on large probabilistic graph databases
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.1587/transfun.e102.a.379openalex-snapshot
Efficient Algorithms to Augment the Edge-Connectivity of Specified Vertices by One in a Graph
inferred← citeshttps://doi.org/10.1587/transinf.e95.d.769openalex-snapshot
A Fast Algorithm for Augmenting Edge-Connectivity by One with Bipartition Constraints
inferred← citeshttps://doi.org/10.22052/ijmc.2015.9056openalex-snapshot
A New Approach to Compute Acyclic Chromatic Index of Certain Chemical Structures
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
inferred← citeshttps://doi.org/10.5402/2012/932456openalex-snapshot
An Overview of Algorithms for Network Survivability
inferred← citeshttps://doi.org/10.5555/1496770.1496798openalex-snapshot
A near-linear time algorithm for constructing a cactus representation of minimum cuts
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.