Graph Drawing

DOI10.1007/11618058zbMATH Open1152.68485OpenAlexW4251892597MaRDI QIDQ5897646FDOQ5897646

Authors: Maurizio Patrignani 

Publication date: 13 November 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11618058

Recommendations

• ON EXTENDING A PARTIAL STRAIGHT-LINE DRAWING
• Extending Partial Orthogonal Drawings
• Extending partial orthogonal drawings
• Extending simple drawings
• Extending drawings of graphs to arrangements of pseudolines
• Extending drawings of graphs to arrangements of pseudolines
• Extending convex partial drawings of graphs
• On Planar Polyline Drawings
• Straight-Line Drawing of Quadrangulations

zbMATH Keywords

computational complexityplanar graphsgraph drawingstraight-line drawing

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62)

Cited In (10)

• \(\beta\)-stars or on extending a drawing of a connected subgraph
• The complexity of drawing a graph in a polygonal region
• Extending partial orthogonal drawings
• Anchored drawings of planar graphs
• Extending orthogonal planar graph drawings is fixed-parameter tractable
• The complexity of drawing a graph in a polygonal region
• Extending convex partial drawings of graphs
• ON EXTENDING A PARTIAL STRAIGHT-LINE DRAWING
• Testing planarity of partially embedded graphs
• Extending simple drawings

This page was built for publication: Graph Drawing

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