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 24 items.
- The complexity of clustering in planar graphs (Q3983251) (← links)
- On the computational complexity of (O,P)-partition problems (Q4210668) (← links)
- Network optimization on partitioned pairs of points (Q5136221) (← links)
- Star Partitions of Perfect Graphs (Q5167740) (← links)
- (Q5233771) (← links)
- PARTITIONING TREES OF SUPPLY AND DEMAND (Q5462677) (← links)
- (Q5708519) (← links)
- (Q5708525) (← links)
- The Price of Connectivity in Fair Division (Q5864211) (← links)
- Approximating bottleneck spanning trees on partitioned tuples of points (Q5881545) (← links)
- Approximation algorithms for maximally balanced connected graph partition (Q5918464) (← links)
- Approximation algorithms for some minimum postmen cover problems (Q5918771) (← links)
- Reconfiguration of connected graph partitions via recombination (Q5925556) (← links)
- Reconfiguration of connected graph partitions via recombination (Q5925672) (← links)
- On three polynomial kernels of sequences for arbitrarily partitionable graphs (Q5962512) (← links)
- Decomposing subcubic graphs into claws, paths or triangles (Q6056758) (← links)
- Reconfiguration of connected graph partitions (Q6093138) (← links)
- Approximation and parameterized algorithms for balanced connected partition problems (Q6102278) (← links)
- 3D geo-graphs: efficient flip verification for the spherical zoning problem (Q6110624) (← links)
- Balanced connected partitions of graphs: approximation, parameterization and lower bounds (Q6166191) (← links)
- Connected graph partitioning with aggregated and non‐aggregated gap objective functions (Q6180037) (← links)
- On the complexity of list \(\mathcal{H}\)-packing for sparse graph classes (Q6575414) (← links)
- Counting connected partitions of graphs (Q6606326) (← links)
- Arbitrarily edge-partitionable graphs (Q6648283) (← links)
