Drawing graphs using modular decomposition

DOI10.7155/JGAA.00155MaRDI QIDQ5301424zbMATH OpenOpenAlexFDO

Authors Charis Papadopoulos, Costas Voglis

Publication date 19 January 2009

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

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL http://www.emis.de/journals/JGAA/accepted/2007/PapadopoulosVoglis2007.11.2.pdf

zbMATH Keywords

undirected graphspring embedder algorithm

Mathematics Subject Classification ID

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

Recommendations

• Graph Drawing
• A survey of the algorithmic aspects of modular decomposition
• Efficient and practical algorithms for sequential modular decomposition
• Algorithm Theory - SWAT 2004
• scientific article; zbMATH DE number 1456953

Cited in

(5)

• Visualizing large graphs
• Counting spanning trees in graphs using modular decomposition
• Counting spanning trees using modular decomposition
• Graph Drawing
• \(\boldsymbol{(\alpha, \beta )}\)-Modules in Graphs

This page was built for publication: Drawing graphs using modular decomposition

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