Fast and simple horizontal coordinate assignment

DOI10.1007/3-540-45848-4_3MaRDI QIDQ3043702zbMATH OpenFDO

Authors Ulrik Brandes, Boris Köpf

Publication date 6 August 2004

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

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2265/22650031.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

• Computing and Combinatorics
• A flow formulation for horizontal coordinate assignment with prescribed width
• A fast layout algorithm for k-level graphs
• Size- and port-aware horizontal node coordinate assignment
• A flow formulation for horizontal coordinate assignment with prescribed width

Cited in

(12)

• A flow formulation for horizontal coordinate assignment with prescribed width
• Tabu search tutorial. A graph drawing application
• Layered drawing of undirected graphs with generalized port constraints
• Size- and port-aware horizontal node coordinate assignment
• A generalization of the directed graph layering problem
• Upward planar drawings on the standing and the rolling cylinders
• A fast layout algorithm for k-level graphs
• Layered Drawing of Undirected Graphs with Generalized Port Constraints
• A flow formulation for horizontal coordinate assignment with prescribed width
• A new framework for hierarchical drawings
• Coordinate Assignment for Cyclic Level Graphs
• Drawing Graphs with GLEE

This page was built for publication: Fast and simple horizontal coordinate assignment

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