Pages that link to "Item:Q4305362"
From MaRDI portal
The following pages link to The Complexity of Multiterminal Cuts (Q4305362):
Displaying 50 items.
- Parameterized complexity of the anchored \(k\)-core problem for directed graphs (Q259037) (← links)
- Extended cuts (Q266025) (← links)
- On the minimum and maximum selective graph coloring problems in some graph classes (Q266810) (← links)
- On approximating the memory-constrained module allocation problem (Q286996) (← links)
- A lower bound of \(8/(7+\frac{1}{k-1})\) on the integrality ratio of the Călinescu-Karloff-Rabani relaxation for multiway cut (Q294793) (← links)
- Parameterized complexity dichotomy for \textsc{Steiner Multicut} (Q295637) (← links)
- Complexity of metric dimension on planar graphs (Q314819) (← links)
- Roman domination in subgraphs of grids (Q324726) (← links)
- Towards duality of multicommodity multiroute cuts and flows: multilevel ball-growing (Q372974) (← links)
- The complexity of multicut and mixed multicut problems in (di)graphs (Q391767) (← links)
- Fast approximate energy minimization with label costs (Q409135) (← links)
- An approximation algorithm for the generalized \(k\)-multicut problem (Q423940) (← links)
- Restricted vertex multicut on permutation graphs (Q444445) (← links)
- Polyhedral study of the connected subgraph problem (Q468440) (← links)
- Finding the closest ultrametric (Q476304) (← links)
- Algorithmic aspects of homophyly of networks (Q501003) (← links)
- Fixed-parameter algorithms for DAG partitioning (Q507587) (← links)
- Analysis of budget for interdiction on multicommodity network flows (Q513161) (← links)
- Path-disruption games: bribery and a probabilistic model (Q519896) (← links)
- Approximation algorithms for \(k\)-hurdle problems (Q627530) (← links)
- Computing minimum cuts by randomized search heuristics (Q633832) (← links)
- Primal-dual approximation algorithms for integral flow and multicut in trees (Q679443) (← links)
- Minimal multicut and maximal integer multiflow: a survey (Q707131) (← 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)
- Parameterized graph separation problems (Q820151) (← links)
- CPG graphs: some structural and hardness results (Q827595) (← links)
- The multi-terminal vertex separator problem: branch-and-cut-and-price (Q827608) (← links)
- Experimental evaluation of a local search approximation algorithm for the multiway cut problem (Q831743) (← links)
- Approximation algorithms for requirement cut on graphs (Q848961) (← links)
- Partial multicuts in trees (Q861281) (← links)
- Algorithms for shortest paths and \(d\)-cycle problems (Q876687) (← links)
- The multi-multiway cut problem (Q884458) (← links)
- Improved parameterized and exact algorithms for cut problems on trees (Q896125) (← links)
- Community detection with the weighted parsimony criterion (Q904925) (← 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)
- Generating cut conjunctions in graphs and related problems (Q930604) (← links)
- Compact samples for data dissemination (Q931716) (← links)
- Inapproximability of the Tutte polynomial (Q937302) (← links)
- On the complexity of the multicut problem in bounded tree-width graphs and digraphs (Q944745) (← links)
- Disjoint paths in sparse graphs (Q967419) (← links)
- Optimal cuts in graphs and statistical mechanics (Q967941) (← links)
- Simple and improved parameterized algorithms for multiterminal cuts (Q987378) (← links)
- An improved approximation algorithm for requirement cut (Q991474) (← links)
- Revisiting a simple algorithm for the planar multiterminal cut problem (Q991478) (← links)
- Eisenberg-Gale markets: algorithms and game-theoretic properties (Q993788) (← links)
- Color-texture segmentation using unsupervised graph cuts (Q1010080) (← links)
- Cardinality constrained and multicriteria (multi)cut problems (Q1013079) (← links)
- A simple algorithm for multicuts in planar graphs with outer terminals (Q1026166) (← links)
