Pages that link to "Item:Q707131"
From MaRDI portal
The following pages link to Minimal multicut and maximal integer multiflow: a survey (Q707131):
Displaying 42 items.
- Extended cuts (Q266025) (← links)
- The data transfer problem in a system of systems (Q319366) (← links)
- The complexity of multicut and mixed multicut problems in (di)graphs (Q391767) (← links)
- Multicut in trees viewed through the eyes of vertex cover (Q440014) (← links)
- Restricted vertex multicut on permutation graphs (Q444445) (← links)
- Solving coloring, minimum clique cover and kernel problems on arc intersection graphs of directed paths on a tree (Q548676) (← links)
- A heuristic method for the minimum toll booth problem (Q604959) (← links)
- A new strategy for the undirected two-commodity maximum flow problem (Q711380) (← links)
- The multi-terminal maximum-flow network-interdiction problem (Q713097) (← links)
- On the hardness of finding near-optimal multicuts in directed acyclic graphs (Q719273) (← links)
- Improved parameterized and exact algorithms for cut problems on trees (Q896125) (← links)
- Maximum integer multiflow and minimum multicut problems in two-sided uniform grid graphs (Q924540) (← links)
- Exact and approximate resolution of integral multiflow and multicut problems: Algorithms and complexity (Q926573) (← links)
- On the complexity of the multicut problem in bounded tree-width graphs and digraphs (Q944745) (← links)
- Simple and improved parameterized algorithms for multiterminal cuts (Q987378) (← links)
- Cardinality constrained and multicriteria (multi)cut problems (Q1013079) (← links)
- Multicuts and integral multiflows in rings (Q1041998) (← links)
- An \(O(\sqrt n)\)-approximation algorithm for directed sparsest cut (Q1045922) (← links)
- The critical node detection problem in networks: a survey (Q1750314) (← links)
- Models and methods for solving the problem of network vulnerability (Q1951863) (← links)
- Solution methods for the vertex variant of the network system vulnerability analysis problem (Q2017536) (← links)
- Max-multiflow/min-multicut for G+H series-parallel (Q2275455) (← links)
- Complexity of the multicut problem, in its vanilla, partial and generalized versions, in graphs of bounded treewidth (Q2290633) (← links)
- Complexity and exact algorithms for vertex multicut in interval and bounded treewidth graphs (Q2462149) (← links)
- Finding edge-disjoint paths in networks: an ant colony optimization algorithm (Q2466394) (← links)
- The maximum integer multiterminal flow problem in directed graphs (Q2643793) (← links)
- Improving multicut in directed trees by upgrading nodes (Q2643926) (← links)
- The prize-collecting call control problem on weighted lines and rings (Q2798111) (← links)
- New results on planar and directed multicuts (Q2851464) (← links)
- On the minimum cut separator problem (Q2892143) (← links)
- Correlation Clustering with Constrained Cluster Sizes and Extended Weights Bounds (Q2947231) (← links)
- Multiflow Feasibility: An Annotated Tableau (Q2971612) (← links)
- How to Cut a Graph into Many Pieces (Q3010400) (← links)
- Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms (Q3158558) (← links)
- Multiway cut and integer flow problems in trees (Q3439138) (← links)
- Algorithms for Multiterminal Cuts (Q3503649) (← links)
- Multicut Is FPT (Q4605273) (← links)
- (Q5020878) (← links)
- (Q5089231) (← links)
- Partitioning Graph Drawings and Triangulated Simple Polygons into Greedily Routable Regions (Q5370573) (← links)
- Approximating maximum integral multiflows on bounded genus graphs (Q6142346) (← links)
- An approximation algorithm for the \(\boldsymbol{K}\)-prize-collecting multicut problem in trees with submodular penalties (Q6620014) (← links)