Genetic algorithms for drawing bipartite graphs

DOI10.1080/00207169408804322zbMath0839.68072OpenAlexW1971156580MaRDI QIDQ4844579

Mika Sieranta, Erkki Maekinen

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)

Related Items

Metaheuristics: A bibliography, Minimizing crossings in hierarchical digraphs with a hybridized genetic algorithm

Uses Software

• Genocop

Cites Work

• Unnamed Item
• Edge crossings in drawings of bipartite graphs
• Crossing Number is NP-Complete
• Crossing Theory and Hierarchy Mapping
• Toward a theory of crossing numbers
• A SPECIAL CROSSING NUMBER FOR BIPARTITE GRAPHS: A RESEARCH PROBLEM
• Experiments on drawing 2-level hierarchical graphs