On the 2-layer window width minimization problem

DOI10.1007/978-3-031-23101-8_14OpenAlexW4313429545MaRDI QIDQ6169525

No author found.

Publication date: 14 August 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-23101-8_14

zbMATH Keywords

bipartite graphsgraph drawing2-layer drawingswindow width

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Unnamed Item
• Unnamed Item
• Comparing trees via crossing minimization
• The NP-completeness of the bandwidth minimization problem
• Edge crossings in drawings of bipartite graphs
• Drawing (complete) binary tanglegrams
• A Tale of Two Communities: Assessing Homophily in Node-Link Diagrams
• Optimizing a Radial Layout of Bipartite Graphs for a Tool Visualizing Security Alerts
• Crossing Number is NP-Complete
• A tanglegram Kuratowski theorem
• Drawing graphs. Methods and models

This page was built for publication: On the 2-layer window width minimization problem