2-Layer Graph Drawings with Bounded Pathwidth
David R. Wood
TL;DR
This paper characterizes bipartite graphs of bounded pathwidth through properties of 2-layer graph drawings, providing insights into their structural constraints and visual representations.
Contribution
It identifies specific properties of 2-layer drawings that characterize bipartite graphs with bounded pathwidth, advancing understanding of their structure.
Findings
Characterization of bipartite graphs with bounded pathwidth
Properties of 2-layer drawings linked to graph pathwidth
Structural insights into bipartite graph representations
Abstract
We determine which properties of 2-layer drawings characterise bipartite graphs of bounded pathwidth.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputational Geometry and Mesh Generation · Manufacturing Process and Optimization · 3D Shape Modeling and Analysis