scientific article; zbMATH DE number 1974108

zbMATH Open1037.68566MaRDI QIDQ4422263FDOQ4422263

Authors: Carla Binucci, Walter Didimo, Giuseppe Liotta, Maddalena Nonato 

Publication date: 3 September 2003

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

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

Recommendations

• scientific article; zbMATH DE number 2084273
• Orthogonal drawings of graphs with vertex and edge labels
• scientific article; zbMATH DE number 1693471
• scientific article; zbMATH DE number 1974102
• Computing orthogonal drawings with the minimum number of bends
• Computing orthogonal drawings with the minimum number of bends
• Algorithms for area-efficient orthogonal drawing
• Orthogonal drawings based on the stratification of planar graphs
• Orthogonal drawings based on the stratification of planar graphs
• Algorithms and bounds for overloaded orthogonal drawings

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 (5)

• Inapproximability of orthogonal compaction
• Title not available (Why is that?)
• Orthogonal drawings of graphs with vertex and edge labels
• On the complexity of orthogonal compaction
• A combinatorial approach to orthognal placement problems

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 Q4422263)