Visualization of bipartite graphs in limited window size

DOI10.1007/S00236-025-00483-1MaRDI QIDQ6994510zbMATH OpenFDO

Authors Alon Efrat, W. Evans, Kassian Köck, Stephen G. Kobourov, Jacob Miller

Publication date 23 April 2025

Published in Acta Informatica (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S00236-025-00483-1

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)

Cites work

• A linear time algorithm for maximum matchings in convex, bipartite graphs
• Algorithms for two bottleneck optimization problems
• Circular convex bipartite graphs: Maximum matching and Hamiltonian circuits
• Comparing trees via crossing minimization
• Computational geometry. Algorithms and applications.
• Drawing (complete) binary tanglegrams
• Drawing graphs. Methods and models
• Edge crossings in drawings of bipartite graphs
• scientific article; zbMATH DE number 2123123 (Why is no real title available?)
• scientific article; zbMATH DE number 3231692 (Why is no real title available?)
• scientific article; zbMATH DE number 7646025 (Why is no real title available?)
• Maximum flow and minimum-cost flow in almost-linear time
• Maximum matching in a convex bipartite graph
• On the 2-layer window width minimization problem
• Parameterized Complexity of Vertex Splitting to Pathwidth at Most 1
• Some simplified NP-complete graph problems

This page was built for publication: Visualization of bipartite graphs in limited window size

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