scientific article; zbMATH DE number 1163705

MaRDI QIDQ4395318zbMATH OpenFDO

Authors Alan A. Bertossi, Roberto Battiti

Publication date 4 August 1998

zbMATH Keywords

greedy schemestabu search

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Data structures (68P05) Graph theory (including graph drawing) in computer science (68R10) Communication networks in operations research (90B18) Combinatorial optimization (90C27) Programming involving graphs or networks (90C35)

Recommendations

• scientific article; zbMATH DE number 910878
• scientific article; zbMATH DE number 1054945
• scientific article; zbMATH DE number 3891429
• Solution of large weighted equicut problems

Cited in

(7)

• Network bipartitioning in the anti-communicability Euclidean space
• Speeding up a memetic algorithm for the max-bisection problem
• A reactive self-tuning scheme for multilevel graph partitioning
• An efficient approach for large scale graph partitioning
• scientific article; zbMATH DE number 1241383 (Why is no real title available?)
• scientific article; zbMATH DE number 1054945 (Why is no real title available?)
• On partitioning of hypergraphs

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4395318)