Book embeddability of series-parallel digraphs

DOI10.1007/s00453-005-1185-7zbMath1099.68075OpenAlexW2023293538WikidataQ62042582 ScholiaQ62042582MaRDI QIDQ2505497

Giuseppe Liotta, Stephen K. Wismath, Emilio Di Giacomo, Walter Didimo

Publication date: 26 September 2006

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-005-1185-7

zbMATH Keywords

point-set embeddability problemupward two-page book embeddings

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (19)

On the Page Number of Upward Planar Directed Acyclic Graphs ⋮ A Sublinear Bound on the Page Number of Upward Planar Graphs ⋮ Upward book embeddability of \(st\)-graphs: complexity and algorithms ⋮ Recognizing DAGs with page-number 2 is NP-complete ⋮ \(st\)-orientations with few transitive edges ⋮ $st$-Orientations with Few Transitive Edges ⋮ An annotated review on graph drawing and its applications ⋮ Upward Partitioned Book Embeddings ⋮ Experimental Evaluation of Book Drawing Algorithms ⋮ Computing Upward Topological Book Embeddings of Upward Planar Digraphs ⋮ Computing upward topological book embeddings of upward planar digraphs ⋮ Drawing colored graphs with constrained vertex positions and few bends per edge ⋮ Recognizing DAGs with page-number 2 is NP-complete ⋮ On the upward book thickness problem: combinatorial and complexity results ⋮ On the upward book thickness problem: combinatorial and complexity results ⋮ 2-colored point-set embeddings of partial 2-trees ⋮ Upward Book Embeddings of st-Graphs ⋮ NodeTrix planarity testing with small clusters ⋮ Upward straight-line embeddings of directed graphs into point sets

This page was built for publication: Book embeddability of series-parallel digraphs