scientific article; zbMATH DE number 2080085

MaRDI QIDQ4472290zbMATH OpenFDO

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

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)

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

Cited in

(9)

• A better heuristic for area-compaction of orthogonal representations
• Orthogonal drawings of graphs with vertex and edge labels
• scientific article; zbMATH DE number 2185601 (Why is no real title available?)
• scientific article; zbMATH DE number 2084272 (Why is no real title available?)
• Graph compact orthogonal layout algorithm
• Hardness of approximate compaction for nonplanar orthogonal graph drawings
• scientific article; zbMATH DE number 1342138 (Why is no real title available?)
• Upward planar drawings with two slopes
• A flow formulation for horizontal coordinate assignment with prescribed width

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)