Multiple-way network partitioning

DOI10.1109/12.8730zbMath0709.94615OpenAlexW2086629796MaRDI QIDQ3495206

Laura A. Sanchis

Publication date: 1989

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/1802/6624

Mathematics Subject Classification ID

Information and communication theory, circuits (94-XX)

Related Items

Evaluating the Kernighan-Lin Heuristic for Hardware/Software Partitioning, The optimal partitioning of networks, A branch-and-bound algorithm for the acyclic partitioning problem, Graph bisection revisited, Moving clusters within a memetic algorithm for graph partitioning, Efficient algorithms for single- and two-layer linear placement of parallel graphs, Quotient geometric crossovers and redundant encodings, An Efficient Semidefinite Programming Relaxation for the Graph Partition Problem, Reformulated acyclic partitioning for rail-rail containers transshipment, The decomposition of a communication network considering traffic demand interrelations, VLSI Placement Using Quadratic Programming and Network Partitioning Techniques, Adapting Iterative-Improvement Heuristics for Scheduling File-Sharing Tasks on Heterogeneous Platforms, Reducing Rollbacks Through Partitioning in PCS Parallel Simulation, A TWO-STATE ANT COLONY ALGORITHM FOR SOLVING THE MINIMUM GRAPH BISECTION PROBLEM, Semidefinite programming and eigenvalue bounds for the graph partition problem, Network Flow-Based Refinement for Multilevel Hypergraph Partitioning