Pages that link to "Item:Q1952501"
From MaRDI portal
The following pages link to Generating partitions of a graph into a fixed number of minimum weight cuts (Q1952501):
Displaying 4 items.
- A heuristic method for solving the problem of partitioning graphs with supply and demand (Q256649) (← links)
- Partitioning of supply/demand graphs with capacity limitations: an ant colony approach (Q1698074) (← links)
- Global optimization of multilevel electricity market models including network design and graph partitioning (Q2010915) (← links)
- Computing finest mincut partitions of a graph and application to routing problems (Q2473036) (← links)