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 14 items.
- A plane graph representation of triconnected graphs (Q410724) (← 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)
- A robust algorithm for bisecting a triconnected graph with two resource sets (Q2566018) (← links)
- FULLY POLYNOMIAL-TIME APPROXIMATION SCHEMES FOR THE MAX–MIN CONNECTED PARTITION PROBLEM ON INTERVAL GRAPHS (Q2905305) (← links)
- PARTITIONING TREES OF SUPPLY AND DEMAND (Q5462677) (← links)
- (Q5708519) (← links)
- (Q5708525) (← links)