Using a Significant Spanning Tree to Draw a Directed Graph

DOI10.7155/JGAA.00168zbMATH Open1161.68674OpenAlexW2103173494MaRDI QIDQ5301439FDOQ5301439

Authors Martin Harrigan, Patrick Healy

Publication date 19 January 2009

Published in Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Full work available at URL http://www.emis.de/journals/JGAA/accepted/2008/HarriganHealy2008.12.3.pdf

zbMATH Keywords

globally oriented Fiedler vector

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• scientific article; zbMATH DE number 30296
• Drawing directed acyclic graphs: an experimental study
• scientific article; zbMATH DE number 1974120
• Algorithms and bounds for drawing directed graphs
• An algorithm for drawing general undirected graphs

Cited in

(2)

• How to use spanning trees to navigate in graphs
• Level planarity: transitivity vs. even crossings

This page was built for publication: Using a Significant Spanning Tree to Draw a Directed Graph

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