Book embeddability of series-parallel digraphs
From MaRDI portal
Publication:2505497
DOI10.1007/s00453-005-1185-7zbMath1099.68075WikidataQ62042582 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
68W05: Nonnumerical algorithms
68R10: Graph theory (including graph drawing) in computer science
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
Related Items
Upward Partitioned Book Embeddings, Experimental Evaluation of Book Drawing Algorithms, Upward Book Embeddings of st-Graphs, Computing Upward Topological Book Embeddings of Upward Planar Digraphs, 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, Recognizing DAGs with page-number 2 is NP-complete, A Sublinear Bound on the Page Number of Upward Planar Graphs, Upward book embeddability of \(st\)-graphs: complexity and algorithms, \(st\)-orientations with few transitive edges, $st$-Orientations with Few Transitive Edges, Drawing colored graphs with constrained vertex positions and few bends per edge, Upward straight-line embeddings of directed graphs into point sets, Computing upward topological book embeddings of upward planar digraphs, NodeTrix planarity testing with small clusters, Recognizing DAGs with page-number 2 is NP-complete, On the Page Number of Upward Planar Directed Acyclic Graphs
