On drawing regular bipartite graphs

DOI10.1080/00207169208804071MaRDI QIDQ4016900zbMATH OpenOpenAlexFDO

Authors Erkki Mäkinen

Publication date 16 January 1993

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

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

zbMATH Keywords

assignment heuristicbarycenter heuristicgraph drawingmedian heuristicregular bipartite graphs

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• scientific article; zbMATH DE number 1974130
• Edge crossings in drawings of bipartite graphs
• scientific article; zbMATH DE number 4128387
• New bounds on the barycenter heuristic for bipartite graph drawing.
• Drawing graphs in two layers

Cites work

• Experiments on drawing 2-level hierarchical graphs
• scientific article; zbMATH DE number 3963860 (Why is no real title available?)

Cited in

(9)

• Coloring drawings of bipartite graphs: A problem in automated assembly
• New bounds on the barycenter heuristic for bipartite graph drawing.
• Topological Drawings of Complete Bipartite Graphs
• Drawing Bipartite Graphs on Two Curves
• scientific article; zbMATH DE number 1974130 (Why is no real title available?)
• scientific article; zbMATH DE number 1512079 (Why is no real title available?)
• scientific article; zbMATH DE number 7030516 (Why is no real title available?)
• Graph Drawing
• Drawing Bipartite Graphs on Two Parallel Convex Curves

This page was built for publication: On drawing regular bipartite graphs

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