The following pages link to A simple min-cut algorithm (Q4377588):
Displaying 50 items.
- Time constrained maximal covering salesman problem with weighted demands and partial coverage (Q342578) (← links)
- Partitioning planar graphs: a fast combinatorial approach for max-cut (Q434180) (← links)
- A combinatorial model and algorithm for globally searching community structure in complex networks (Q437056) (← links)
- Hearing the clusters of a graph: A distributed algorithm (Q445023) (← links)
- Certifying algorithms (Q465678) (← links)
- On the complexity of computing the \(k\)-restricted edge-connectivity of a graph (Q501666) (← links)
- Exact algorithms for cluster editing: Evaluation and experiments (Q534775) (← links)
- Hybridizing evolutionary algorithms with variable-depth search to overcome local optima (Q633833) (← links)
- Graph connectivity and its augmentation: Applications of MA orderings (Q697579) (← links)
- Finding minimum 3-way cuts in hypergraphs (Q765477) (← links)
- Minimum degree orderings (Q848936) (← links)
- Strongly polynomial bounds for multiobjective and parametric global minimum cuts in graphs and hypergraphs (Q896272) (← links)
- Complexity of the min-max (regret) versions of min cut problems (Q924631) (← links)
- Minimizing symmetric submodular functions (Q1290631) (← links)
- Inverse maximum capacity problems (Q1387947) (← links)
- A note on the minimization of symmetric and general submodular functions (Q1410698) (← links)
- Weight reduction problems with certain bottleneck objectives. (Q1417504) (← links)
- Cardinality constrained minimum cut problems: complexity and algorithms. (Q1427809) (← links)
- Decomposition-by-normalization (DBN): leveraging approximate functional dependencies for efficient CP and Tucker decompositions (Q1741131) (← links)
- A comparison of algorithms for finding an efficient theme park tour (Q1741683) (← links)
- On graphs of the cone decompositions for the min-cut and max-cut problems (Q1751487) (← links)
- Connectivity interdiction (Q1785279) (← links)
- Topological optimization of reliable networks under dependent failures (Q1785625) (← links)
- Computing minimum multiway cuts in hypergraphs (Q1799394) (← links)
- Parametric analysis of overall min-cuts and applications in undirected networks. (Q1853178) (← links)
- Personal reminiscence: combinatorial and discrete optimization problems in which I have been interested (Q1926640) (← links)
- Models and methods for solving the problem of network vulnerability (Q1951863) (← links)
- Graph clustering, variational image segmentation methods and Hough transform scale detection for object measurement in images (Q2014485) (← links)
- An FPT algorithm for matching cut and d-cut (Q2115892) (← links)
- Decision-based scenario clustering for decision-making under uncertainty (Q2171324) (← links)
- Cuts in undirected graphs. I (Q2215599) (← links)
- Finding densest \(k\)-connected subgraphs (Q2235249) (← links)
- A fast algorithm for cactus representations of minimum cuts (Q2258383) (← links)
- Computing vertex-disjoint paths in large graphs using MAOs (Q2285055) (← links)
- Symmetric submodular system: contractions and Gomory-Hu tree (Q2304523) (← links)
- I/O efficient algorithms for the minimum cut problem on unweighted undirected graphs (Q2339449) (← links)
- Parameterized algorithms for min-max multiway cut and list digraph homomorphism (Q2396830) (← links)
- Divide-and-conquer algorithms for partitioning hypergraphs and submodular systems (Q2428700) (← links)
- The prize-collecting generalized minimum spanning tree problem (Q2476612) (← links)
- A min-cut approach to functional regionalization, with a case study of the Italian local labour market areas (Q2629905) (← links)
- New algorithms for a simple measure of network partitioning (Q2700788) (← links)
- A new?old algorithm for minimum-cut and maximum-flow in closure graphs (Q2744651) (← links)
- Diffuse Interface Models on Graphs for Classification of High Dimensional Data (Q2805269) (← links)
- On the Complexity of Computing the k-restricted Edge-connectivity of a Graph (Q2827813) (← links)
- Minimum Cuts and Shortest Cycles in Directed Planar Graphs via Noncrossing Shortest Paths (Q2968519) (← links)
- Constrained and bicriteria inverse bottleneck optimization problems under weighted Hamming distance (Q3225072) (← links)
- Approximating Spectral Clustering via Sampling: A Review (Q3297374) (← links)
- LP Relaxation and Tree Packing for Minimum $k$-Cut (Q3300759) (← links)
- Minimum Cuts of Simple Graphs in Almost Always Linear Time (Q3605499) (← links)
- Minimum Cuts and Sparsification in Hypergraphs (Q4561257) (← links)
