On-line graph algorithms with SPQR-trees
- Cite this paper as:
- Di Battista G., Tamassia R. (1990) On-line graph algorithms with SPQR-trees. In: Paterson M.S. (eds) Automata, Languages and Programming. ICALP 1990. Lecture Notes in Computer Science, vol 443. Springer, Berlin, Heidelberg
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.
Unable to display preview. Download preview PDF.