Pages that link to "Item:Q1888147"
From MaRDI portal
The following pages link to A combined evolutionary search and multilevel optimisation approach to graph-partitioning (Q1888147):
Displaying 20 items.
- A deterministic annealing algorithm for approximating a solution of the min-bisection problem (Q280315) (← links)
- An effective multilevel tabu search approach for balanced graph partitioning (Q622162) (← links)
- An exact combinatorial algorithm for minimum graph bisection (Q747771) (← links)
- An efficient memetic algorithm for the graph partitioning problem (Q763098) (← links)
- Moving clusters within a memetic algorithm for graph partitioning (Q1665049) (← links)
- An exact algorithm for graph partitioning (Q1942271) (← links)
- Parallel mesh-partitioning algorithms for generating shape optimised partitions using evolutionary computing (Q2378081) (← links)
- Finding near-optimal independent sets at scale (Q2401330) (← links)
- A reactive self-tuning scheme for multilevel graph partitioning (Q2422870) (← links)
- A new method, the fusion fission, for the relaxed \(k\)-way graph partitioning problem, and comparisons with some multilevel algorithms (Q2466393) (← links)
- An efficient approach for large scale graph partitioning (Q2467568) (← links)
- Unique optimal solution instance and computational complexity of backbone in the graph bi-partitioning problem (Q2482999) (← links)
- Advanced Coarsening Schemes for Graph Partitioning (Q2828188) (← links)
- A discrete dynamic convexized method for VLSI circuit partitioning (Q2867400) (← links)
- Graph Bisection with Pareto Optimization (Q4577953) (← links)
- (Q5140710) (← links)
- Tree-Based Coarsening and Partitioning of Complex Networks (Q5266614) (← links)
- Flow-Based Algorithms for Improving Clusters: A Unifying Framework, Software, and Performance (Q5883297) (← links)
- ILP-Based Local Search for Graph Partitioning (Q6039924) (← links)
- Better Process Mapping and Sparse Quadratic Assignment (Q6039926) (← links)