On-line graph algorithms with SPQR-trees

  • Giuseppe Di Battista
  • Roberto Tamassia
Conference paper

DOI: 10.1007/BFb0032061

Part of the Lecture Notes in Computer Science book series (LNCS, volume 443)
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

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag 1990

Authors and Affiliations

  • Giuseppe Di Battista
    • 1
  • Roberto Tamassia
    • 2
  1. 1.Dipartimento di Informatica e SistemisticaUniversità di Roma “La Sapienza”RomeItaly
  2. 2.Department of Computer ScienceBrown UniversityProvidence

Personalised recommendations