Pages that link to "Item:Q4305362"
From MaRDI portal
The following pages link to The Complexity of Multiterminal Cuts (Q4305362):
Displaying 50 items.
- Reducing the domination number of graphs via edge contractions and vertex deletions (Q2219962) (← links)
- Parameterized complexity of spare capacity allocation and the multicost Steiner subgraph problem (Q2253903) (← links)
- Discrete and continuous models for partitioning problems (Q2254249) (← links)
- Capacitated partial inverse maximum spanning tree under the weighted Hamming distance (Q2279743) (← links)
- Complexity of the multicut problem, in its vanilla, partial and generalized versions, in graphs of bounded treewidth (Q2290633) (← links)
- A simple algorithm for the multiway cut problem (Q2294387) (← links)
- Semitotal domination: new hardness results and a polynomial-time algorithm for graphs of bounded mim-width (Q2304548) (← links)
- Beating the 2-approximation factor for global bicut (Q2316621) (← links)
- Approximation algorithms for vertex happiness (Q2326078) (← links)
- On the parameterized complexity of separating certain sources from the target (Q2330108) (← links)
- Fixed-parameter tractability for subset feedback set problems with parity constraints (Q2344735) (← links)
- The maximum time of 2-neighbour bootstrap percolation: algorithmic aspects (Q2346581) (← links)
- Complexity dichotomy for oriented homomorphism of planar graphs with large girth (Q2355705) (← links)
- On Lipschitz extension from finite subsets (Q2357002) (← links)
- The partition problem (Q2366610) (← links)
- A logical approach to multicut problems (Q2379958) (← links)
- Separation of partition inequalities with terminals (Q2386198) (← links)
- One more well-solved case of the multifacility location problem (Q2386213) (← links)
- Supermodular functions and the complexity of MAX CSP (Q2387428) (← links)
- An improved parameterized algorithm for the minimum node multiway cut problem (Q2391180) (← links)
- Parameterized algorithms for min-max multiway cut and list digraph homomorphism (Q2396830) (← links)
- Multicuts in planar and bounded-genus graphs with bounded number of terminals (Q2408168) (← links)
- Constrained coalition formation on valuation structures: formal framework, applications, and islands of tractability (Q2409675) (← links)
- The vertex \(k\)-cut problem (Q2419357) (← links)
- On the generalized multiway cut in trees problem (Q2436662) (← links)
- An \(O^\ast(1.84^k)\) parameterized algorithm for the multiterminal cut problem (Q2445900) (← links)
- On the complexity of the selective graph coloring problem in some special classes of graphs (Q2453167) (← links)
- Cut problems in graphs with a budget constraint (Q2457298) (← links)
- The complexity of soft constraint satisfaction (Q2457608) (← links)
- Complexity and exact algorithms for vertex multicut in interval and bounded treewidth graphs (Q2462149) (← links)
- Steiner diagrams and \(k\)-star hubs (Q2466026) (← links)
- Optimal 3-terminal cuts and linear programming (Q2490332) (← links)
- Some formulations for the group Steiner tree problem (Q2500536) (← links)
- Correlation clustering in general weighted graphs (Q2503347) (← links)
- Generalized \(k\)-multiway cut problems (Q2504075) (← links)
- On a bidirected relaxation for the MULTIWAY CUT problem (Q2565851) (← links)
- List coloring in the absence of two subgraphs (Q2636800) (← links)
- On the connectivity preserving minimum cut problem (Q2637652) (← links)
- The maximum integer multiterminal flow problem in directed graphs (Q2643793) (← links)
- Mean isoperimetry with control on outliers: exact and approximation algorithms (Q2672637) (← links)
- Submodular reassignment problem for reallocating agents to tasks with synergy effects (Q2673247) (← links)
- Eulerian walks in temporal graphs (Q2689257) (← links)
- A simple algorithm for the planar multiway cut problem (Q2731602) (← links)
- A new-old algorithm for minimum-cut and maximum-flow in closure graphs. (Q2744651) (← links)
- A Lagrangian Relaxation-Based Heuristic to Solve Large Extended Graph Partitioning Problems (Q2803836) (← links)
- A Compact Representation for Minimizers of k-Submodular Functions (Extended Abstract) (Q2835693) (← links)
- Defending planar graphs against star-cutsets (Q2851448) (← links)
- New results on planar and directed multicuts (Q2851464) (← links)
- Edge identifying codes (Q2857369) (← links)
- On Multiway Cut Parameterized above Lower Bounds (Q2891333) (← links)
