Pages that link to "Item:Q4564264"
From MaRDI portal
The following pages link to A PROBE-Based Heuristic for Graph Partitioning (Q4564264):
Displaying 6 items.
- An effective multilevel tabu search approach for balanced graph partitioning (Q622162) (← links)
- An exact combinatorial algorithm for minimum graph bisection (Q747771) (← links)
- An experimental evaluation of local search heuristics for graph partitioning (Q1382773) (← links)
- Speeding up a memetic algorithm for the max-bisection problem (Q2353470) (← links)
- A heuristic approach for dividing graphs into bi-connected components with a size constraint (Q2403269) (← links)
- Evaluation of a Flow-Based Hypergraph Bipartitioning Algorithm (Q5075796) (← links)