Abstract
We present the SPQR-tree, a versatile data structure that represents the decomposition of a biconnected graph with respect to its triconnected components, and show its application to a variety of on-line graph algorithms dealing with triconnectivity, transitive closure, minimum spanning tree, and planarity testing. The results are further extended to general graphs by means of another data structure, the BC-tree.
Cite
CITATION STYLE
Di Battista, G., & Tamassia, R. (1990). On-line graph algorithms with SPQR-trees. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 443 LNCS, pp. 598–611). Springer Verlag. https://doi.org/10.1007/bfb0032061
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
