Pages that link to "Item:Q2466001"
From MaRDI portal
The following pages link to Partitioning a graph of bounded tree-width to connected subgraphs of almost uniform size (Q2466001):
Displaying 15 items.
- A mixed integer linear programming model and variable neighborhood search for maximally balanced connected partition problem (Q274945) (← links)
- On tree-partition-width (Q1024321) (← links)
- Partitioning graphs of bounded tree-width (Q1307308) (← links)
- Uniform and most uniform partitions of trees (Q1756346) (← links)
- On finding connected balanced partitions of trees (Q2028065) (← links)
- An overview of graph covering and partitioning (Q2142633) (← links)
- Partitioning a weighted tree into subtrees with weights in a given range (Q2428691) (← links)
- Political Districting for Elections to the German Bundestag: An Optimization-Based Multi-stage Heuristic Respecting Administrative Boundaries (Q2806924) (← links)
- Connected bin packing problem on traceable graphs (Q3390778) (← links)
- A Rooted-Forest Partition with Uniform Vertex Demand (Q3404442) (← links)
- Partitioning a Weighted Tree to Subtrees of Almost Uniform Size (Q3596718) (← links)
- Enumerating graph partitions without too small connected components using zero-suppressed binary and ternary decision diagrams (Q5140733) (← links)
- Graph-Theoretic Concepts in Computer Science (Q5710818) (← links)
- Reconfiguration of connected graph partitions via recombination (Q5925556) (← links)
- Reconfiguration of connected graph partitions via recombination (Q5925672) (← links)
