A genetic approach for network partitioning

DOI10.1080/00207169208804049MaRDI QIDQ3989752zbMATH OpenOpenAlexFDO

Authors Lin-Ming Jin, Shu Park Chan

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

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)

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

Cites work

• scientific article; zbMATH DE number 194544 (Why is no real title available?)
• An Improved Min-Cut Algonthm for Partitioning VLSI Networks
• Optimization by simulated annealing

Cited in

(9)

• Genetic algorithms for the analysis of Bayesian hierarchical partition models
• Metaheuristics: A bibliography
• Genetic algorithm and graph partitioning
• A methodology for multicriteria network partitioning
• Partitioning of VLSI Circuits on Subcircuits with Minimal Number of Connections Using Evolutionary Algorithm
• Recent directions in netlist partitioning: a survey
• scientific article; zbMATH DE number 1962880 (Why is no real title available?)
• Efficient multiple-way network-partitioning algorithm
• scientific article; zbMATH DE number 2040784 (Why is no real title available?)

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)