The following pages link to Multiple-way network partitioning (Q3495206):
Displaying 16 items.
- A branch-and-bound algorithm for the acyclic partitioning problem (Q336782) (← links)
- Quotient geometric crossovers and redundant encodings (Q418019) (← links)
- The decomposition of a communication network considering traffic demand interrelations (Q679227) (← links)
- Efficient algorithms for single- and two-layer linear placement of parallel graphs (Q1130417) (← links)
- Graph bisection revisited (Q1657405) (← links)
- Moving clusters within a memetic algorithm for graph partitioning (Q1665049) (← links)
- Reformulated acyclic partitioning for rail-rail containers transshipment (Q1735174) (← links)
- Semidefinite programming and eigenvalue bounds for the graph partition problem (Q2349129) (← links)
- An Efficient Semidefinite Programming Relaxation for the Graph Partition Problem (Q2967612) (← links)
- A TWO-STATE ANT COLONY ALGORITHM FOR SOLVING THE MINIMUM GRAPH BISECTION PROBLEM (Q3401072) (← links)
- Adapting Iterative-Improvement Heuristics for Scheduling File-Sharing Tasks on Heterogeneous Platforms (Q3603112) (← links)
- VLSI Placement Using Quadratic Programming and Network Partitioning Techniques (Q3842992) (← links)
- The optimal partitioning of networks (Q3993635) (← links)
- Reducing Rollbacks Through Partitioning in PCS Parallel Simulation (Q4420156) (← links)
- Network Flow-Based Refinement for Multilevel Hypergraph Partitioning (Q5140705) (← links)
- Evaluating the Kernighan-Lin Heuristic for Hardware/Software Partitioning (Q5308326) (← links)
