Implementing a Partitioned 2-Page Book Embedding Testing Algorithm
From MaRDI portal
Publication:4912192
DOI10.1007/978-3-642-36763-2_8zbMath1378.68125arXiv1209.0598OpenAlexW2100593384WikidataQ56689200 ScholiaQ56689200MaRDI QIDQ4912192
Patrizio Angelini, Marco di Bartolomeo, Giuseppe Di Battista
Publication date: 3 April 2013
Published in: Graph Drawing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1209.0598
Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items (5)
A Sublinear Bound on the Page Number of Upward Planar Graphs ⋮ Upward book embeddability of \(st\)-graphs: complexity and algorithms ⋮ Upward Partitioned Book Embeddings ⋮ Simpler algorithms for testing two-page book embedding of partitioned graphs ⋮ Upward Book Embeddings of st-Graphs
This page was built for publication: Implementing a Partitioned 2-Page Book Embedding Testing Algorithm
