Pages that link to "Item:Q287104"
From MaRDI portal
The following pages link to A linear-time algorithm for four-partitioning four-connected planar graphs (Q287104):
Displaying 17 items.
- On some properties of doughnut graphs (Q334123) (← links)
- Max-min weight balanced connected partition (Q386475) (← links)
- Partitioning powers of traceable or Hamiltonian graphs (Q391776) (← links)
- A plane graph representation of triconnected graphs (Q410724) (← links)
- On minimal arbitrarily partitionable graphs (Q456092) (← links)
- Algorithms for computing a parameterized \(st\)-orientation (Q959815) (← links)
- Decomposing trees with large diameter (Q986542) (← links)
- On the shape of decomposable trees (Q1043555) (← links)
- Edge-orders (Q1741850) (← links)
- Partitioning a graph into balanced connected classes: formulations, separation and experiments (Q2030323) (← links)
- NP-completeness of st-orientations for plane graphs (Q2268858) (← links)
- FULLY POLYNOMIAL-TIME APPROXIMATION SCHEMES FOR THE MAX–MIN CONNECTED PARTITION PROBLEM ON INTERVAL GRAPHS (Q2905305) (← links)
- A LINEAR-TIME ALGORITHM TO FIND FOUR INDEPENDENT SPANNING TREES IN FOUR CONNECTED PLANAR GRAPHS (Q5248999) (← links)
- PARTITIONING TREES OF SUPPLY AND DEMAND (Q5462677) (← links)
- CONVEX GRID DRAWINGS OF FOUR-CONNECTED PLANE GRAPHS (Q5493893) (← links)
- (Q5708519) (← links)
- Balanced connected partitions of graphs: approximation, parameterization and lower bounds (Q6166191) (← links)
