scientific article; zbMATH DE number 2084286

zbMATH Open1054.68607MaRDI QIDQ3043733FDOQ3043733

Authors: David R. Wood 

Publication date: 6 August 2004

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2265/22650312.htm

Title of this publication is not available (Why is that?)

Recommendations

• Degree constrained book embeddings
• Three-dimensional orthogonal graph drawing algorithms
• scientific article; zbMATH DE number 2084285
• Bounds For Orthogonal 3-D Graph Drawing
• Minimising the number of bends and volume in 3-dimensional orthogonal graph drawings with a diagonal vertex layout

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cited In (11)

• Embedding iterated line digraphs in books
• Linkless symmetric drawings of series parallel digraphs
• Characterizations of deque and queue graphs
• Upward book embeddings of st-graphs
• Upward book embeddability of \(st\)-graphs: complexity and algorithms
• Stack-number is not bounded by queue-number
• Improved book-embeddings of incomplete hypercubes
• An annotated bibliography on 1-planarity
• The Topology of Bendless Three-Dimensional Orthogonal Graph Drawing
• Structural properties of subdivided-line graphs
• Three-Dimensional Drawings of Bounded Degree Trees

This page was built for publication:

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