Pages that link to "Item:Q1057062"
From MaRDI portal
The following pages link to On the complexity of partitioning graphs into connected subgraphs (Q1057062):
Displayed 28 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)
- 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)
- 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)
- Bisecting a 4-connected graph with three resource sets (Q997070) (← 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)
- 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)
- Flight gate scheduling with respect to a reference schedule (Q1761900) (← links)
- On the complexity of partitioning a graph into a few connected subgraphs (Q2352361) (← 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)
- FULLY POLYNOMIAL-TIME APPROXIMATION SCHEMES FOR THE MAX–MIN CONNECTED PARTITION PROBLEM ON INTERVAL GRAPHS (Q2905305) (← links)
- Edge-Disjoint Packing of Stars and Cycles (Q3467879) (← links)
- PARTITIONING TREES OF SUPPLY AND DEMAND (Q5462677) (← links)
- (Q5708519) (← links)
- (Q5708525) (← links)
- On three polynomial kernels of sequences for arbitrarily partitionable graphs (Q5962512) (← links)