Skip to main content
Springer Nature Link
Log in

A New Approach to Graph Recognition and Applications to Distance-Hereditary Graphs

  • Regular Paper
  • Published:
Journal of Computer Science and Technology Aims and scope Submit manuscript

Abstract

Algorithms used in data mining and bioinformatics have to deal with huge amount of data efficiently. In many applications, the data are supposed to have explicit or implicit structures. To develop efficient algorithms for such data, we have to propose possible structure models and test if the models are feasible. Hence, it is important to make a compact model for structured data, and enumerate all instances efficiently. There are few graph classes besides trees that can be used for a model. In this paper, we investigate distance-hereditary graphs. This class of graphs consists of isometric graphs and hence contains trees and cographs. First, a canonical and compact tree representation of the class is proposed. The tree representation can be constructed in linear time by using prefix trees. Usually, prefix trees are used to maintain a set of strings. In our algorithm, the prefix trees are used to maintain the neighborhood of vertices, which is a new approach unlike the lexicographically breadth-first search used in other studies. Based on the canonical tree representation, efficient algorithms for the distance-hereditary graphs are proposed, including linear time algorithms for graph recognition and graph isomorphism and an efficient enumeration algorithm. An efficient coding for the tree representation is also presented; it requires ⌈3.59n⌉ bits for a distance-hereditary graph of n vertices and 3n bits for a cograph. The results of coding improve previously known upper bounds (both are 2O(n log n)) of the number of distance-hereditary graphs and cographs to 2⌈3.59n⌉ and 23n, respectively.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  1. Holder L B, Cook D J, Djoko S. Substructure discovery in the SUBDUE system. In AAAI Workshop on Knowledge Discovery in Databases, Seattle, Washington, U.S.A., July 31–August 4, 1994, pp.169–180.

  2. Inokuchi A, Washio T, Motoda H. An apriori-based algorithm for mining frequent substructures from graph data. In Proc. European Conf. Principles and Practice of Knowledge Discovery in Databases (PKDD), Lyon, France, Sept. 13–16, 2000, LNCS 1910, Springer-Verlag, pp.13–23.

  3. Zaki M J. Efficiently mining frequent trees in a forest. In Proc. the 8th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Edmonton, Alberta, Canada, July 23–26, 2002, ACM Press, pp.71–80.

  4. Asai T, Arimura H, Uno T et al. Discovering frequent substructures in large unordered trees. In Proc. Discovery Science (DS’03), Sapporo, Japan, Oct. 17–19, 2003, Lecture Notes in Artificial Intelligence, Vol. 2843, Springer-Verlag, pp.47–61.

  5. Munro J I, Raman V. Succinct representation of balanced parentheses, static trees and planar graphs. In Proc. the 38 th Ann. Symp. Foundation of Computer Science, Miami Beach, Florida, USA, October 20–22, 1997, ACM Press, pp.118–126.

  6. Munro J I, Raman V. Succinct representation of balanced parentheses and static trees. SIAM Journal on Computing, 2001, 31(3): 762–776.

    Article  MATH  MathSciNet  Google Scholar 

  7. Nakano S I. Efficient generation of plane trees. Information Processing Letters, 2002, 84(3): 167–172.

    Article  MATH  MathSciNet  Google Scholar 

  8. Geary R, Rahman N, Raman R, Raman V. A simple optimal representation for balanced parentheses. In Proc. Symp. Combinatorial Pattern Matching (CPM), Istanbul, Turkey, July 5–7, 2004, LNCS 3109, Springer-Verlag, pp.159–172.

  9. Knuth D E. Generating All Trees. The Art of Computer Programming, Volume 4, Fascicle 4 Edition, Addison-Wesley, 2005.

  10. Brandstädt A, Le V B, Spinrad J P. Graph Classes: A Survey. SIAM, 1999.

  11. Golumbic M C. Algorithmic Graph Theory and Perfect Graphs. Annals of Discrete Mathematics, 57, 2nd Edition, Elsevier, 2004.

  12. Rose D J, Tarjan R E, Lueker G S. Algorithmic aspects of vertex elimination on graphs. SIAM Journal on Computing, 1976, 5(2): 266–283.

    Article  MATH  MathSciNet  Google Scholar 

  13. Corneil D G. Lexicographic breadth first search — A survey. In Proc. Graph-Theoretic Concepts in Computer Science (WG 2004), Bad Honnef, Germany, June 21–23, 2004, LNCS 3353, Springer-Verlag, pp.1–19.

  14. Knuth D E. Sorting and Searching. The Art of Computer Programming, Volume 3, 2nd Edition, Addison-Wesley Publishing Company, 1998.

  15. Damiand G, Habib M, Paul C. A simple paradigm for graph recognition: Application to cographs and distance hereditary graphs. Theoretical Computer Science, 2001, 263(1/2): 99–111.

    Article  MATH  MathSciNet  Google Scholar 

  16. Bretscher A, Corneil D, Habib M, Paul C. A simple linear time LexBFS cograph recognition algorithm. In Proc. Graph-Theoretic Concepts in Computer Science (WG 2003), Elspeet, The Netherlands, June 19–21, 2003, LNCS 2880, Springer-Verlag, pp.119–130.

  17. Howorka E. A characterization of distance-gereditary graphs. Quart. J. Math. Oxford, 1977, 28(4): 417–420.

    Article  MATH  MathSciNet  Google Scholar 

  18. Bandelt H-J, Mulder H M. Distance-hereditary graphs. Journal of Combinatorial Theory, Series B, 1986, 41(2): 182–208.

    Article  MATH  MathSciNet  Google Scholar 

  19. D’Atri A, Moscarini M. Distance-hereditary graphs, Steiner trees, and connected domination. SIAM Journal on Computing, 1988, 17(3): 521–538.

    Article  MathSciNet  Google Scholar 

  20. Hammer P L, Maffray F. Completely separable graphs. Discrete Applied Mathematics, 1990, 27(1/2): 85–99.

    Article  MATH  MathSciNet  Google Scholar 

  21. Chang M S, Hsieh S Y, Chen G-H. Dynamic programming on distance-hereditary graphs. In Proc. the 8th Int. Symp. Algorithms and Computation (ISAAC’97), Singapore, Dec. 17–19, 1997, LNCS 1350, Springer-Verlag, pp.344–353.

  22. Brandstädt A, Dragan F F. A linear-time algorithm for connected r-domination and Steiner tree on distance-hereditary graphs. Networks, 1998, 31(3): 177–182.

    Article  MATH  MathSciNet  Google Scholar 

  23. Broersma H J, Dahlhaus E, Kloks T. A linear time algorithm for minimum fill-in and treewidth for distance hereditary graphs. Discrete Applied Mathematics, 2000, 99(1–3): 367–400.

    Article  MATH  MathSciNet  Google Scholar 

  24. Nicolai F, Szymczak T. Homogeneous sets and domination: A linear time algorithm for distance-hereditary graphs. Networks, 2001, 37(3): 117–128.

    Article  MATH  MathSciNet  Google Scholar 

  25. Hsieh S-Y, Ho C-W, Hsu T-S, Ko M-T. Efficient algorithms for the Hamiltonian problem on distance-hereditary graphs. In Proc. COCOON 2002, Singapore, August 15–17, 2002, LNCS 2387, Springer-Verlag, pp.77–86.

  26. Chang M S, Wu S-C, Chang G J, Yeh H-G. Domination in distance-hereditary graphs. Discrete Applied Mathematics, 2002, 116(1/2): 103–113.

    Article  MATH  MathSciNet  Google Scholar 

  27. Oum S i. Graphs of bounded rank-width [Ph.D. Dissertation]. Princeton University, 2005.

  28. Chandler D B, Chang M-S, Kloks T, Liu J, Peng S-L. Recognition of probe cographs and partitioned probe distance hereditary graphs. In Proc. Algorithmic Aspects in Information and Management (AAIM), Hong Kong, China, June 20–22, 2006, LNCS 4041, Springer-Verlag, pp.267–278.

  29. Gioan E, Paul C. Dynamic distance hereditary graphs using split decomposition. In Proc. the 18th International Symposium on Algorithms and Computation (ISAAC 2007), Sendai, Japan, December 17–19, 2007, LNCS 4835, Springer-Verlag, pp.41–51.

  30. Spinrad J P. Efficient Graph Representations. American Mathematical Society, 2003.

  31. Corneil D G, Perl Y, Stewart L K. A linear recognition algorithm for cographs. SIAM Journal on Computing, 1985, 14(4): 926–934.

    Article  MATH  MathSciNet  Google Scholar 

  32. Lueker G S, Booth K S. A linear time algorithm for deciding interval graph isomorphism. Journal of the ACM, 1979, 26(2): 183–195.

    Article  MATH  MathSciNet  Google Scholar 

  33. Colbourn C J, Booth K S. Linear time automorphism algorithms for trees, interval graphs, and planar graphs. SIAM Journal on Computing, 1981, 10(1): 203–225.

    Article  MATH  MathSciNet  Google Scholar 

  34. Nakano S, Uno T. Constant time generation of trees with specified diameter. In Proc. Graph-Theoretic Concepts in Computer Science (WG 2004), Bad Honnef, Germany, June 21–23, 2004, LNCS 3353, Springer-Verlag, pp.33–45.

  35. Jacobson G. Space-efficient static trees and graphs. In Proc. 30th Symp. Foundations of Computer Science, North Carolina, October 30–November 1, 1989, IEEE, pp.549–554.

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Faculty of Engineering, Gunma University, Gunma, 376-8515, Japan

    Shin-ichi Nakano (Member, ACM, IEEE)

  2. School of Information Science, Japan Advanced Institute of Science and Technology, Ishikawa, 923-1292, Japan

    Ryuhei Uehara (Member, ACM, IEEE)

  3. National Institute of Informatics, Tokyo, 101-8430, Japan

    Takeaki Uno

Authors
  1. Shin-ichi Nakano
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ryuhei Uehara
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Takeaki Uno
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Shin-ichi Nakano.

Additional information

The extended abstract was presented at the 4th Annual Conference on Theory and Applications of Models of Computation (TAMC07). This work was partially done while the second and third authors were visiting ETH Zürich, Switzerland.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Nakano, Si., Uehara, R. & Uno, T. A New Approach to Graph Recognition and Applications to Distance-Hereditary Graphs. J. Comput. Sci. Technol. 24, 517–533 (2009). https://doi.org/10.1007/s11390-009-9242-3

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11390-009-9242-3

Keywords