Degree constrained book embeddings

DOI10.1016/S0196-6774(02)00249-3MaRDI QIDQ4806603zbMATH OpenOpenAlexFDO

Authors David R. Wood

Publication date 14 May 2003

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0196-6774(02)00249-3

zbMATH Keywords

GraphLas Vegas algorithmBook embeddingBook thicknessMultilayer VLSIPage degreePage numberPushdown graph

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Oriented book embeddings
• scientific article; zbMATH DE number 6902663
• Parameterized algorithms for book embedding problems
• Parameterized algorithms for book embedding problems
• Upward partitioned book embeddings
• scientific article; zbMATH DE number 3980512
• One-Page Book Embedding under Vertex-Neighborhood Constraints
• Book embeddings of regular graphs

Cited in

(11)

• Optimal Partition of a Bipartite Graph with Prescribed Layout into Non-Crossing b-Matchings
• Embedding generalized Petersen graph in books
• Book embeddings of regular graphs
• scientific article; zbMATH DE number 2084286 (Why is no real title available?)
• A survey on book-embedding of planar graphs
• Embedding connected double-loop networks with even cardinality in books
• Efficient deterministic algorithms for embedding graphs on books
• Book embeddings of \(k\)-framed graphs and \(k\)-map graphs
• Exact wirelength of hypercubes on a grid
• Vertex Types in Book-Embeddings
• Geometric thickness in a grid

This page was built for publication: Degree constrained book embeddings

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