On the public citation graph
Implementing an efficient minimum capacity cut algorithm
0 signed · 83 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/jgt.3190170302openalex-snapshot
On sparse subgraphs preserving connectivity properties
inferredcites →https://doi.org/10.1007/bf01580850openalex-snapshot
An efficient algorithm for the minimum capacity cut problem
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.1137/0405004openalex-snapshot
Computing Edge-Connectivity in Multigraphs and Capacitated Graphs
inferredcites →https://doi.org/10.1145/167088.167281openalex-snapshot
An Õ(n 2 ) algorithm for minimum cuts
inferredcites →https://doi.org/10.1145/48014.61051openalex-snapshot
A new approach to the maximum-flow problem
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.eorms0505openalex-snapshot
Mathematical Programming Approaches to the Traveling Salesman Problem
inferred← citeshttps://doi.org/10.1002/9780470400531.eorms0509openalex-snapshot
Maximum Flow Algorithms
inferred← citeshttps://doi.org/10.1002/net.21830openalex-snapshot
A branch‐and‐bound algorithm for the time‐dependent travelling salesman problem
inferred← citeshttps://doi.org/10.1006/jagm.2000.1136openalex-snapshot
Cut Tree Algorithms: An Experimental Study
inferred← citeshttps://doi.org/10.1007/0-306-48109-x_2openalex-snapshot
Enumerating Near-Min S-T Cuts
inferred← citeshttps://doi.org/10.1007/11537311_28openalex-snapshot
A Simple and Fast Min-cut Algorithm
inferred← citeshttps://doi.org/10.1007/3-540-48777-8_25openalex-snapshot
Experimental Evaluation of Approximation Algorithms for Single-Source Unsplittable Flow
inferred← citeshttps://doi.org/10.1007/978-3-031-21534-6_6openalex-snapshot
Recent Advances in Practical Data Reduction
inferred← citeshttps://doi.org/10.1007/978-3-540-24838-5_16openalex-snapshot
Implementing Approximation Algorithms for the Single-Source Unsplittable Flow Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-00202-1_20openalex-snapshot
Minimum Cuts of Simple Graphs in Almost Always Linear Time
inferred← citeshttps://doi.org/10.1007/bf01585863openalex-snapshot
Minimizing symmetric submodular functions
inferred← citeshttps://doi.org/10.1007/bf02366865openalex-snapshot
Minimum cut problem using bases of extended polymatroids
inferred← citeshttps://doi.org/10.1007/pl00011426openalex-snapshot
A cutting plane algorithm for the General Routing Problem
inferred← citeshttps://doi.org/10.1007/s00224-007-2010-2openalex-snapshot
A Simple and Fast Min-Cut Algorithm
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/s00453-019-00658-6openalex-snapshot
Speeding Up the Gomory-Hu Parallel Cut Tree Algorithm with Efficient Graph Contractions
inferred← citeshttps://doi.org/10.1007/s004539910009openalex-snapshot
Practical Performance of Efficient Minimum Cut Algorithms
inferred← citeshttps://doi.org/10.1007/s10288-003-0012-8openalex-snapshot
Primal separation algorithms
inferred← citeshttps://doi.org/10.1007/s10589-025-00660-5openalex-snapshot
Two-commodity opposite direction network flow formulations for the travelling salesman problem
inferred← citeshttps://doi.org/10.1007/s10791-011-9173-9openalex-snapshot
The optimum clustering framework: implementing the cluster hypothesis
inferred← citeshttps://doi.org/10.1016/j.adhoc.2020.102092openalex-snapshot
An Asynchronous Distributed Algorithm for Minimum s − t Cut Detection in Wireless Multi-hop Networks
inferred← citeshttps://doi.org/10.1016/j.cor.2017.06.026openalex-snapshot
An integer programming approach for the time-dependent traveling salesman problem with time windows
inferred← citeshttps://doi.org/10.1016/j.cor.2023.106482openalex-snapshot
Theoretical and computational analysis of a new formulation for the Rural Postman Problem and the General Routing Problem
inferred← citeshttps://doi.org/10.1016/j.disopt.2007.05.002openalex-snapshot
Exploiting planarity in separation routines for the symmetric traveling salesman problem
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/j.jpdc.2017.04.007openalex-snapshot
Parallel cut tree algorithms
inferred← citeshttps://doi.org/10.1016/j.orl.2004.12.001openalex-snapshot
A fast algorithm for minimum weight odd circuits and cuts in planar graphs
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)00470-5openalex-snapshot
A note on the minimization of symmetric and general submodular functions
inferred← citeshttps://doi.org/10.1016/s0377-2217(99)00119-8openalex-snapshot
An optimization problem arising in the design of multiring systems
inferred← citeshttps://doi.org/10.1017/9781316888568.003openalex-snapshot
Preliminaries: Shortest Path 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.1023/a:1009739202898openalex-snapshot
Deterministic Õ(nm) Time Edge-Splitting in Undirected Graphs
inferred← citeshttps://doi.org/10.1080/01605682.2023.2253852openalex-snapshot
Operational Research: methods and applications
inferred← citeshttps://doi.org/10.1080/15427951.2004.10129093openalex-snapshot
Graph Clustering and Minimum Cut Trees
inferred← citeshttps://doi.org/10.1093/bioinformatics/bth935openalex-snapshot
Predicting protein folding pathways
inferred← citeshttps://doi.org/10.1109/ipdps.2019.00013openalex-snapshot
Shared-Memory Exact Minimum Cuts
inferred← citeshttps://doi.org/10.1137/1.9781611976007.4openalex-snapshot
Shared-Memory Branch-and-Reduce for Multiterminal Cuts
inferred← citeshttps://doi.org/10.1137/1.9781611976830.10openalex-snapshot
Faster Parallel Multiterminal Cuts
inferred← citeshttps://doi.org/10.1137/1.9781611977042.2openalex-snapshot
Practical Fully Dynamic Minimum Cut Algorithms
inferred← citeshttps://doi.org/10.1145/1064546.1180614openalex-snapshot
Implementing approximation algorithms for the single-source unsplittable flow problem
inferred← citeshttps://doi.org/10.1145/237814.237830openalex-snapshot
Deterministic Õ(nm) time edge-splitting in undirected graphs
inferred← citeshttps://doi.org/10.1287/moor.22.2.257openalex-snapshot
Separating Clique Trees and Bipartition Inequalities Having a Fixed Number of Handles and Teeth in Polynomial Time
inferred← citeshttps://doi.org/10.1287/trsc.1060.0181openalex-snapshot
The Robust Traveling Salesman Problem with Interval Data
inferred← citeshttps://doi.org/10.1287/trsc.1120.0449openalex-snapshot
Analysis and Branch-and-Cut Algorithm for the Time-Dependent Travelling Salesman Problem
inferred← citeshttps://doi.org/10.15807/jorsj.41.626openalex-snapshot
ANOTHER SIMPLE PROOF OF THE VALIDITY OF NAGAMOCHI AND IBARAKI'S MIN-CUT ALGORITHM AND QUEYRANNE'S EXTENSION TO SYMMETRIC SUBMODULAR FUNCTION MINIMIZATION
inferred← citeshttps://doi.org/10.21597/jist.1569294openalex-snapshot
Kentsel Yol Ağlarında Kritik Kenar Tespiti için Etkin Bir Algoritma
inferred← citeshttps://doi.org/10.23919/cnsm50824.2020.9269062openalex-snapshot
A Distributed Depth First Search based Algorithm for Edge Connectivity Estimation
inferred← citeshttps://doi.org/10.3390/electronics14142904openalex-snapshot
Detection of Critical Links for Improving Network Resilience
inferred← citeshttps://doi.org/10.4230/lipics.esa.2020.59openalex-snapshot
Finding All Global Minimum Cuts In Practice
inferred← citeshttps://doi.org/10.47749/t/unicamp.1999.211144openalex-snapshot
Algoritmos combinatorios para a logistica de distribuição
inferred← citeshttps://doi.org/10.48550/arxiv.1409.6967openalex-snapshot
Symmetric Submodular Clustering with Actionable Constraint
inferred← citeshttps://doi.org/10.48550/arxiv.2108.04566openalex-snapshot
Algorithm Engineering for Cut Problems
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0603108openalex-snapshot
Minimizing Symmetric Set Functions Faster
inferred← citeshttps://doi.org/10.5555/313651.313669openalex-snapshot
A combinatorial algorithm for minimizing symmetric submodular functions
inferred← citeshttps://doi.org/10.5753/wscad.2015.14283openalex-snapshot
Construção Paralela de Árvores de Cortes Utilizando Contrações de Grafo Otimizadas
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.