Genetic algorithms for drawing bipartite graphs

DOI10.1080/00207169408804322MaRDI QIDQ4844579zbMATH OpenOpenAlexFDO

Authors Mika Sieranta, Erkki Mäkinen

Publication date 28 May 1996

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

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

zbMATH Keywords

genetic algorithmslevel permutation problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• A genetic algorithm for graph bisection
• Genetic algorithm and graph partitioning
• scientific article; zbMATH DE number 1283859
• scientific article; zbMATH DE number 1791676
• scientific article; zbMATH DE number 1974130

Cites work

• A SPECIAL CROSSING NUMBER FOR BIPARTITE GRAPHS: A RESEARCH PROBLEM
• Crossing Number is NP-Complete
• Crossing Theory and Hierarchy Mapping
• Edge crossings in drawings of bipartite graphs
• Experiments on drawing 2-level hierarchical graphs
• scientific article; zbMATH DE number 107465 (Why is no real title available?)
• Toward a theory of crossing numbers

Cited in

(5)

• Metaheuristics: A bibliography
• Minimizing crossings in hierarchical digraphs with a hybridized genetic algorithm
• scientific article; zbMATH DE number 1283859 (Why is no real title available?)
• scientific article; zbMATH DE number 1791676 (Why is no real title available?)
• Tight runtime bounds for evolutionary algorithms on sorting and crossing minimisation for layered graph drawings

Describes a project that uses

Uses Software

• Genocop

This page was built for publication: Genetic algorithms for drawing bipartite graphs

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