Pages that link to "Item:Q2142633"

The following pages link to An overview of graph covering and partitioning (Q2142633):

Displaying 3 items.

• Political districting to minimize cut edges (Q2099493) (← links)
• An efficient heuristic for the \(k\)-partitioning problem (Q6063777) (← links)
• Vertex covering with capacitated trees (Q6179715) (← links)