Integer Programming and Combinatorial Optimization

DOI10.1007/B97946zbMATH Open1092.68631OpenAlexW2484779063MaRDI QIDQ5712464FDOQ5712464

Authors:

Publication date: 23 December 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b97946

Recommendations

• An algorithm for improving graph partitions
• Flow-based algorithms for local graph clustering
• scientific article; zbMATH DE number 437546
• Practical minimum cut algorithms
• scientific article; zbMATH DE number 910878

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Mathematical problems of computer architecture (68M07)

Cited In (9)

• Iterated multilevel simulated annealing for large-scale graph conductance minimization
• An efficient memetic algorithm for the graph partitioning problem
• An exact combinatorial algorithm for minimum graph bisection
• Title not available (Why is that?)
• Flow-Based Algorithms for Improving Clusters: A Unifying Framework, Software, and Performance
• Stagnation-aware breakout tabu search for the minimum conductance graph partitioning problem
• Hypergraph Cuts with General Splitting Functions
• Graph clustering
• An algorithm for improving graph partitions

Uses Software

• METIS

This page was built for publication: Integer Programming and Combinatorial Optimization

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