Pages that link to "Item:Q4294727"
From MaRDI portal
The following pages link to A Polynomial Algorithm for the k-cut Problem for Fixed k (Q4294727):
Displaying 50 items.
- An extended edge-representative formulation for the \(K\)-partitioning problem (Q325479) (← links)
- An exact model for cell formation in group technology (Q373207) (← links)
- Minimum \(d\)-blockers and \(d\)-transversals in graphs (Q411244) (← links)
- Polyhedral study of the connected subgraph problem (Q468440) (← links)
- Tight approximation ratio of a general greedy splitting algorithm for the minimum \(k\)-way cut problem (Q633844) (← links)
- Minimal multicut and maximal integer multiflow: a survey (Q707131) (← links)
- Finding minimum 3-way cuts in hypergraphs (Q765477) (← links)
- Minimum cost subpartitions in graphs (Q845968) (← links)
- Efficient algorithms for the problems of enumerating cuts by non-decreasing weights (Q848944) (← links)
- Optimal cuts in graphs and statistical mechanics (Q967941) (← links)
- Simple and improved parameterized algorithms for multiterminal cuts (Q987378) (← links)
- The planar multiterminal cut problem (Q1130183) (← links)
- A new and improved algorithm for the 3-cut problem (Q1267194) (← links)
- An \(O(k^ 2 n^ 2)\) algorithm to find a \(k\)-partition in a \(k\)- connected graph (Q1322395) (← links)
- On the \(k\)-cut subgraph polytope (Q1340072) (← links)
- Approximation and hardness results for the max \(k\)-uncut problem (Q1630990) (← links)
- Forming \(k\) coalitions and facilitating relationships in social networks (Q1647520) (← links)
- The critical node detection problem in networks: a survey (Q1750314) (← links)
- Greedy splitting algorithms for approximating multiway partition problems (Q1769071) (← links)
- Computing minimum multiway cuts in hypergraphs (Q1799394) (← links)
- On cutting a few vertices from a graph (Q1811082) (← links)
- On generalized greedy splitting algorithms for multiway partition problems (Q1887049) (← links)
- Extended formulations for the \(A\)-cut problem (Q1915806) (← links)
- Generating partitions of a graph into a fixed number of minimum weight cuts (Q1952501) (← links)
- On the \(k\)-cut problem (Q1977642) (← links)
- Isolation branching: a branch and bound algorithm for the \(k \)-terminal cut problem (Q2082183) (← links)
- Computation and algorithm for the minimum \(k\)-edge-connectivity of graphs (Q2082190) (← links)
- Political districting to minimize cut edges (Q2099493) (← links)
- New approximations and hardness results for submodular partitioning problems (Q2115890) (← links)
- An overview of graph covering and partitioning (Q2142633) (← links)
- On integer and bilevel formulations for the \(k\)-vertex cut problem (Q2195678) (← links)
- Using a Min-Cut generalisation to go beyond Boolean surjective VCSPs (Q2211354) (← links)
- Mixed-case community detection problem in social networks: algorithms and analysis (Q2220864) (← links)
- Hypergraph \(k\)-cut in randomized polynomial time (Q2227530) (← links)
- A discrete districting plan (Q2303654) (← links)
- Beating the 2-approximation factor for global bicut (Q2316621) (← links)
- The vertex \(k\)-cut problem (Q2419357) (← links)
- Divide-and-conquer algorithms for partitioning hypergraphs and submodular systems (Q2428700) (← links)
- An \(O^\ast(1.84^k)\) parameterized algorithm for the multiterminal cut problem (Q2445900) (← links)
- Tight lower bounds for certain parameterized NP-hard problems (Q2568440) (← links)
- Inapproximability of maximum biclique problems, minimum \( k\)-cut and densest at-least-\( k\)-subgraph from the small set expansion hypothesis (Q2633244) (← links)
- A polyhedral study of lifted multicuts (Q2688466) (← links)
- Multicriteria cuts and size-constrained \(k\)-cuts in hypergraphs (Q2689813) (← 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)
- The cutting plane method is polynomial for perfect matchings (Q2800362) (← links)
- The minimum cut cover problem (Q2840718) (← links)
- Cutting up is hard to do: the parameterised complexity of \(k\)-cut and related problems (Q2843923) (← links)
- Clique Cover and Graph Separation (Q2943572) (← links)
- Approximation and Hardness Results for the Max k-Uncut Problem (Q2958303) (← links)
