Pages that link to "Item:Q2142633"
From MaRDI portal
The following pages link to An overview of graph covering and partitioning (Q2142633):
Displaying 5 items.
- Political districting to minimize cut edges (Q2099493) (← links)
- Partitions and well-coveredness: the graph sandwich problem (Q2111912) (← links)
- An efficient heuristic for the \(k\)-partitioning problem (Q6063777) (← links)
- Vertex covering with capacitated trees (Q6179715) (← links)
- The heterogeneous rooted tree cover problem (Q6591623) (← links)