scientific article; zbMATH DE number 2080085

zbMATH Open1043.68626MaRDI QIDQ4472290FDOQ4472290

Authors: Gunnar W. Klau, Karsten Klein, Petra Mutzel 

Publication date: 4 August 2004

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

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

Recommendations

• Graph compact orthogonal layout algorithm
• scientific article; zbMATH DE number 1342138
• scientific article; zbMATH DE number 2084272
• A better heuristic for area-compaction of orthogonal representations
• On the complexity of orthogonal compaction

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

• Graph compact orthogonal layout algorithm
• A better heuristic for area-compaction of orthogonal representations
• Title not available (Why is that?)
• A flow formulation for horizontal coordinate assignment with prescribed width
• Orthogonal drawings of graphs with vertex and edge labels
• Hardness of approximate compaction for nonplanar orthogonal graph drawings
• Upward planar drawings with two slopes
• Title not available (Why is that?)

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