On the 2-layer window width minimization problem

DOI10.1007/978-3-031-23101-8_14MaRDI QIDQ6169525zbMATH OpenOpenAlexFDO

Authors

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

2-layer drawingsbipartite graphsgraph drawingwindow width

Mathematics Subject Classification ID

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

Recommendations

• Drawing graphs in two layers
• Heuristics for the maximum 2-layer RAC subgraph problem
• Graph Drawing

Cites work

• A tale of two communities: assessing homophily in node-link diagrams
• A tanglegram Kuratowski theorem
• Comparing trees via crossing minimization
• Crossing Number is NP-Complete
• Drawing (complete) binary tanglegrams
• Drawing graphs. Methods and models
• Edge crossings in drawings of bipartite graphs
• scientific article; zbMATH DE number 2084271 (Why is no real title available?)
• scientific article; zbMATH DE number 2123123 (Why is no real title available?)
• Optimizing a radial layout of bipartite graphs for a tool visualizing security alerts
• The NP-completeness of the bandwidth minimization problem

Cited in

(3)

• Exact and parameterized algorithms for window width minimization in bipartite arrangement
• Visualization of bipartite graphs in limited window size
• Exact and parameterized algorithms for window width minimization in bipartite arrangement

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

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