The SPQR-tree data structure in graph drawing

DOI10.1007/3-540-45061-0_4MaRDI QIDQ4449162zbMATH OpenFDO

Authors Petra Mutzel

Publication date 8 February 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/2719/27190034.htm

Mathematics Subject Classification ID

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

Recommendations

• On-line graph algorithms with SPQR-trees
• Using SPQR-trees to speed up recognition algorithms based on 2-cutsets
• A linear time implementation of SPQR-trees
• On-line maintenance of triconnected components with SPQR-trees
• An SPQR-Tree Approach to Decide Special Cases of Simultaneous Embedding with Fixed Edges

Cited in

(9)

• Using SPQR-trees to speed up recognition algorithms based on 2-cutsets
• An SPQR-tree-like embedding representation for upward planarity
• Using SPQR-trees to speed up algorithms based on 2-cutset decompositions
• On-line graph algorithms with SPQR-trees
• A linear time implementation of SPQR-trees
• Schematic representation of large biconnected graphs
• Maximum cycle packing using SPR-trees
• Visualizing treewidth
• Visualizing treewidth

This page was built for publication: The SPQR-tree data structure in graph drawing

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