Book embeddability of series-parallel digraphs

DOI10.1007/S00453-005-1185-7MaRDI QIDQ2505497zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, S. Wismath

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

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

Recommendations

• scientific article; zbMATH DE number 1974117
• Book embeddings of regular graphs
• scientific article; zbMATH DE number 6902663
• scientific article; zbMATH DE number 3980512
• Book embedding of projective-planar graphs
• Optimum embedding of complete graphs in books
• Book embedding of graphs on the projective plane
• Embedding generalized Petersen graph in books
• Book embedding of toroidal bipartite graphs
• Embedding iterated line digraphs in books

Cited in

(22)

• Computing Upward Topological Book Embeddings of Upward Planar Digraphs
• On the page number of upward planar directed acyclic graphs
• scientific article; zbMATH DE number 1974117 (Why is no real title available?)
• On families of planar DAGs with constant stack number
• Experimental evaluation of book drawing algorithms
• Upward straight-line embeddings of directed graphs into point sets
• An annotated review on graph drawing and its applications
• \(st\)-orientations with few transitive edges
• $st$-Orientations with Few Transitive Edges
• On the upward book thickness problem: combinatorial and complexity results
• Computing upward topological book embeddings of upward planar digraphs
• A Sublinear Bound on the Page Number of Upward Planar Graphs
• 2-colored point-set embeddings of partial 2-trees
• Upward book embeddings of st-graphs
• Upward book embeddability of \(st\)-graphs: complexity and algorithms
• Upward partitioned book embeddings
• Embeddability Problems for Upward Planar Digraphs
• Recognizing DAGs with page-number 2 is NP-complete
• 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 1-bend upward point-set embeddings of \(st\)-digraphs

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

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