Pruning Graphs with Digital Search Trees. Application to Distance Hereditary Graphs
Given a graph, removing pendant vertices (vertices with only one neighbor) and vertices that have a twin (another vertex that has the same neighbors) until it is not possible yields a reduced graph, called the “pruned graph”. In this paper, we present an algorithm which computes this “pruned graph” either in linear time or in linear space. In order to achieve these complexity bounds, we introduce a data structure based on digital search trees. Originally designed to store a family of sets and to test efficiently equalities of sets after the removal of some elements, this data structure finds interesting applications in graph algorithmics. For instance, the computation of the “pruned graph” provides a new and simply implementable algorithm for the recognition of distance-hereditary graphs, and we improve the complexity bounds for the complete bipartite cover problem on bipartite distance-hereditary graphs.
Keywordsgraph algorithms distance-hereditary graphs sets digital search trees amortized complexity
Unable to display preview. Download preview PDF.
- [AHU71]A. V. Aho, I. E. Hopcroft, and J. D. Ullman. The design and analysis of computer algorithms. Addison-Welsey, 1974, exercise 2.12 on page 71.Google Scholar
- [Dam97]G. Damiand. Quelques propriétés des graphes distances héréditaires. Master’s thesis, Université de Montpellier II, LIRMM, 1997.Google Scholar
- [GJ79]M. R. Garey and D. S. Johnson. Computers and Intractability: A guide to the theory of NP-completeness. Freeman, 1979.Google Scholar
- [HMPV97]M. Habib, R. McConnell, C. Paul, and L. Viennot. LexBFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing. Theor. Comp. Sci., 1999. to appear.Google Scholar
- [Knu73]D. E. Knuth. The Art of Computer Programming: Sorting and Searching, volume 3. Addison-Wesley, 1973.Google Scholar
- [WWW]A more detailed version of this article http://www.lirmm.fr/~thierry