Abstract
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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
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.
H. J. Bandelt and H. M. Mulder. Distance-hereditary graphs. J. Combin. Theory, Ser. B, 41:182–208, 1986.
G. Damiand. Quelques propriétés des graphes distances héréditaires. Master’s thesis, Université de Montpellier II, LIRMM, 1997.
M. R. Garey and D. S. Johnson. Computers and Intractability: A guide to the theory of NP-completeness. Freeman, 1979.
P. Hammer and F. Maffray. Completely separable graphs. Discrete Applied Mathematics, 27:85–99, 1990.
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.
E. Howorka. A characterization of distance-hereditary graphs. Quart. J. Math. Oxford, Ser. 2, 28:417–420, 1977.
D. E. Knuth. The Art of Computer Programming: Sorting and Searching, volume 3. Addison-Wesley, 1973.
H. Müller. On edge perfectness and classes of bipartite graphs. Discrete Mathematics, 149:159–187, 1996.
D. J. Rose, R. E. Tarjan, and G. S. Leuker. Algorithmic aspects of vertex elimination on graphs. SIAM J. of Computing, 5(2):266–283, June 1976.
A more detailed version of this article http://www.lirmm.fr/~thierry
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lanlignel, JM., Raynaud, O., Thierry, E. (2000). Pruning Graphs with Digital Search Trees. Application to Distance Hereditary Graphs. In: Reichel, H., Tison, S. (eds) STACS 2000. STACS 2000. Lecture Notes in Computer Science, vol 1770. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46541-3_44
Download citation
DOI: https://doi.org/10.1007/3-540-46541-3_44
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67141-1
Online ISBN: 978-3-540-46541-6
eBook Packages: Springer Book Archive