scientific article; zbMATH DE number 1974120

MaRDI QIDQ4422276zbMATH OpenFDO

Authors Liran Carmel, David Harel, Yehuda Koren

Publication date 3 September 2003

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

• scientific article; zbMATH DE number 30296
• Drawing directed acyclic graphs: an experimental study
• AN ALGORITHM FOR DRAWING A HIERARCHICAL GRAPH
• Drawing recurrent hierarchies
• Algorithms and bounds for drawing directed graphs

Cited in

(10)

• Algorithms and bounds for drawing directed graphs
• Tiers for peers: a practical algorithm for discovering hierarchy in weighted networks
• One-dimensional layout optimization, with applications to graph drawing by axis separation
• Drawing directed graphs clockwise
• scientific article; zbMATH DE number 30296 (Why is no real title available?)
• AN ALGORITHM FOR DRAWING A HIERARCHICAL GRAPH
• Graph Drawing via Gradient Descent, (GD)^2
• A new framework for hierarchical drawings
• Using a Significant Spanning Tree to Draw a Directed Graph
• scientific article; zbMATH DE number 2196291 (Why is no real title available?)

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