Pages that link to "Item:Q510915"
From MaRDI portal
The following pages link to Partitioning a graph into minimum gap components (Q510915):
Displaying 7 items.
- A minimal surface criterion for graph partitioning (Q338611) (← links)
- On finding connected balanced partitions of trees (Q2028065) (← links)
- Metaheuristics for the minimum gap graph partitioning problem (Q2668747) (← links)
- Cardinality constrained connected balanced partitions of trees under different criteria (Q2684048) (← links)
- (Q4873762) (← links)
- Min-Max Graph Partitioning and Small Set Expansion (Q5494941) (← links)
- Connected graph partitioning with aggregated and non‐aggregated gap objective functions (Q6180037) (← links)