A genetic approach for network partitioning

DOI10.1080/00207169208804049zbMATH Open0742.68004OpenAlexW2162394398MaRDI QIDQ3989752FDOQ3989752

Shu Park Chan, Lin-Ming Jin

Publication date: 28 June 1992

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207169208804049

Recommendations

• scientific article; zbMATH DE number 2040784
• Genetic algorithm and graph partitioning
• A genetic algorithm for graph partitioning
• A hybrid genetic algorithm for a combinational circuits partitioning problem
• Performance of a genetic algorithm for the graph partitioning problem

zbMATH Keywords

genetic algorithmsdiscrete optimizationpartitioning\(NP\)-complete problems

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Discrete mathematics in relation to computer science (68R99) Network design and communication in computer systems (68M10)

Cites Work

• Title not available (Why is that?)
• Optimization by Simulated Annealing
• An Improved Min-Cut Algonthm for Partitioning VLSI Networks

Cited In (9)

• Genetic algorithm and graph partitioning
• Title not available (Why is that?)
• Efficient multiple-way network-partitioning algorithm
• Partitioning of VLSI Circuits on Subcircuits with Minimal Number of Connections Using Evolutionary Algorithm
• Genetic algorithms for the analysis of Bayesian hierarchical partition models
• Title not available (Why is that?)
• A methodology for multicriteria network partitioning
• Recent directions in netlist partitioning: a survey
• Metaheuristics: A bibliography

This page was built for publication: A genetic approach for network partitioning

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