Pages that link to "Item:Q1057062"
From MaRDI portal
The following pages link to On the complexity of partitioning graphs into connected subgraphs (Q1057062):
Displaying 50 items.
- A linear-time algorithm for four-partitioning four-connected planar graphs (Q287104) (← links)
- Finding good 2-partitions of digraphs. I. Hereditary properties (Q290530) (← links)
- The VC-dimension of graphs with respect to \(k\)-connected subgraphs (Q335348) (← links)
- Max-min weight balanced connected partition (Q386475) (← links)
- A plane graph representation of triconnected graphs (Q410724) (← links)
- On the complexity of computing the \(k\)-restricted edge-connectivity of a graph (Q501666) (← links)
- Counting connected set partitions of graphs (Q625376) (← links)
- On partitioning a graph into two connected subgraphs (Q650911) (← links)
- Algorithms for gerrymandering over graphs (Q831130) (← links)
- Balanced connected graph partition (Q831759) (← links)
- Approximation algorithm for the balanced 2-connected \(k\)-partition problem (Q896161) (← links)
- A linear algorithm for bipartition of biconnected graphs (Q911298) (← links)
- Bicolored graph partitioning, or: gerrymandering at its worst (Q967425) (← links)
- \(O(m\log n)\) split decomposition of strongly-connected graphs (Q972339) (← links)
- Bisecting a 4-connected graph with three resource sets (Q997070) (← links)
- NP-hard and linear variants of hypergraph partitioning (Q1041217) (← links)
- Solving the 2-rooted mini-max spanning forest problem by branch-and-bound (Q1043334) (← links)
- Representations of graphs and networks (coding, layouts and embeddings) (Q1174904) (← links)
- Generalized partitions of graphs (Q1283792) (← links)
- An \(O(k^ 2 n^ 2)\) algorithm to find a \(k\)-partition in a \(k\)- connected graph (Q1322395) (← links)
- The even adjacency split problem for graphs (Q1566571) (← links)
- An exact algorithm for min-max hyperstructure equipartition with a connected constraint (Q1652415) (← links)
- Flight gate scheduling with respect to a reference schedule (Q1761900) (← links)
- Vertex-partitioning into fixed additive induced-hereditary properties is NP-hard (Q1883661) (← links)
- Partitioning a graph into balanced connected classes: formulations, separation and experiments (Q2030323) (← links)
- Approximation algorithms for the maximally balanced connected graph tripartition problem (Q2082191) (← links)
- Political districting to minimize cut edges (Q2099493) (← links)
- The complexity of the unit stop number problem and its implications to other related problems (Q2136280) (← links)
- An overview of graph covering and partitioning (Q2142633) (← links)
- Approximation algorithms for the maximum bounded connected bipartition problem (Q2151359) (← links)
- More aspects of arbitrarily partitionable graphs (Q2158201) (← links)
- Approximation algorithms for some min-max postmen cover problems (Q2241210) (← links)
- Parliament seating assignment problems (Q2242347) (← links)
- The parameterized complexity landscape of finding 2-partitions of digraphs (Q2330099) (← links)
- On the complexity of partitioning a graph into a few connected subgraphs (Q2352361) (← links)
- Biconnectivity, \(st\)-numbering and other applications of DFS using \(O(n)\) bits (Q2403234) (← links)
- A heuristic approach for dividing graphs into bi-connected components with a size constraint (Q2403269) (← links)
- Degree-constrained 2-partitions of graphs (Q2419120) (← links)
- New bounds and constraint propagation techniques for the clique partitioning problem (Q2446845) (← links)
- A robust algorithm for bisecting a triconnected graph with two resource sets (Q2566018) (← links)
- Finding good 2-partitions of digraphs. II. Enumerable properties (Q2629228) (← links)
- Edge-disjoint packing of stars and cycles (Q2629232) (← links)
- Decomposing Cubic Graphs into Connected Subgraphs of Size Three (Q2817881) (← links)
- On the Complexity of Computing the k-restricted Edge-connectivity of a Graph (Q2827813) (← links)
- Mondshein sequences (a.k.a. (2,1)-orders) (Q2832896) (← links)
- On the facets of the lift-and-project relaxations of graph subdivisions (Q2840709) (← links)
- Fully polynomial-time approximation schemes for the max-min connected partition problem on interval graphs (Q2905305) (← links)
- (Q3368883) (← links)
- Edge-Disjoint Packing of Stars and Cycles (Q3467879) (← links)
- On partitioning the edges of graphs into connected subgraphs (Q3816108) (← links)
