A synthesis on partition refinement: A useful routine for strings, graphs, boolean matrices and automata

  • Michel Habib
  • Christophe Paul
  • Laurent Viennoti
Algorithm and Data Structures I

DOI: 10.1007/BFb0028546

Part of the Lecture Notes in Computer Science book series (LNCS, volume 1373)
Cite this paper as:
Habib M., Paul C., Viennoti L. (1998) A synthesis on partition refinement: A useful routine for strings, graphs, boolean matrices and automata. In: Morvan M., Meinel C., Krob D. (eds) STACS 98. STACS 1998. Lecture Notes in Computer Science, vol 1373. Springer, Berlin, Heidelberg

Abstract

Partition refinement techniques are used in many algorithms. This tool allows efficient computation of equivalence relations and is somehow dual to union-find algorithms. The goal of this paper is to propose a single routine to quickly implement all these already known algorithms and to solve a large class of potentially new problems. Our framework yields to a unique scheme for correctness proofs and complexity analysis. Various examples are presented to show the different ways of using this routine.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag 1998

Authors and Affiliations

  • Michel Habib
    • 1
  • Christophe Paul
    • 1
  • Laurent Viennoti
    • 2
  1. 1.LIRMMMontpellierFrance
  2. 2.LIAFAParisFrance

Personalised recommendations