scientific article; zbMATH DE number 4094839

MaRDI QIDQ3821602zbMATH OpenFDO

Authors

Publication date 1988

zbMATH Keywords

automatic layoutbipartite crossing numberbipartite graphsNP-hardsimulation

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graph theory (including graph drawing) in computer science (68R10) Applications of graph theory to circuits and networks (94C15)

Recommendations

• On bipartite drawings and the linear arrangement problem
• scientific article; zbMATH DE number 1974114
• On bipartite crossings, largest biplanar subgraphs, and the linear arrangement problem
• Edge crossings in drawings of bipartite graphs
• Graph Drawing

Cited in

(9)

• A new lower bound for the bipartite crossing number with applications
• Hybridizing simulated annealing with variable neighborhood search for bipartite graph crossing minimization
• ON THE SATELLITE CROSSING NUMBER CONJECTURE
• The crossing number of the bipartite permutation graph
• Relations Between Crossing Numbers of Complete and Complete Bipartite Graphs
• On the Maximum Crossing Number
• On bipartite crossings, largest biplanar subgraphs, and the linear arrangement problem
• Graph Drawing
• On the Orchard crossing number of the complete bipartite graphs

This page was built for publication:

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