COCOON 2017: Computing and Combinatorics pp 150-161 | Cite as

Efficient Enumeration of Maximal k-Degenerate Subgraphs in a Chordal Graph

  • Alessio Conte
  • Mamadou Moustapha Kanté
  • Yota Otachi
  • Takeaki Uno
  • Kunihiro Wasa
Conference paper
First Online:
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10392)

Abstract

In this paper, we consider the problem of listing the maximal k-degenerate induced subgraphs of a chordal graph, and propose an output-sensitive algorithm using delay \(O(m\cdot \omega (G))\) for any n-vertex chordal graph with m edges, where \(\omega (G) \le n\) is the maximum size of a clique in G. The problem generalizes that of enumerating maximal independent sets and maximal induced forests, which correspond to respectively 0-degenerate and 1-degenerate subgraphs.

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

References

  1. 1.
    Alon, N., Kahn, J., Seymour, P.D.: Large induced degenerate subgraphs. Graph. Combin. 3(1), 203–211 (1987)MathSciNetCrossRefMATHGoogle Scholar
  2. 2.
    Bauer, R., Krug, M., Wagner, D.: Enumerating and generating labeled \(k\)-degenerate graphs. In: 2010 Proceedings of the Seventh Workshop on Analytic Algorithmics and Combinatorics, pp. 90–98. SIAM, Philadelphia (2010)Google Scholar
  3. 3.
    Blair, J.R., Peyton, B.: An introduction to chordal graphs and clique trees. In: George, A., Gilbert, J.R., Liu, J.W.H. (eds.) Graph Theory and Sparse Matrix Computation, pp. 1–29. Springer, New York (1993)Google Scholar
  4. 4.
    Chandran, L.S.: A linear time algorithm for enumerating all the minimum and minimal separators of a chordal graph. In: Wang, J. (ed.) COCOON 2001. LNCS, vol. 2108, pp. 308–317. Springer, Heidelberg (2001). doi: 10.1007/3-540-44679-6_34 CrossRefGoogle Scholar
  5. 5.
    Conte, A., Grossi, R., Marino, A., Versari, L.: Sublinear-space bounded-delay enumeration for massive network analytics: Maximal cliques. In: ICALP (2016)Google Scholar
  6. 6.
    Diestel, R.: Graph Theory (Graduate Texts in Mathematics). Springer, New York (2005)Google Scholar
  7. 7.
    Eiter, T., Makino, K., Gottlob, G.: Computational aspects of monotone dualization: a brief survey. Discrete Appl. Math. 156(11), 2035–2049 (2008)MathSciNetCrossRefMATHGoogle Scholar
  8. 8.
    Enright, J., Kondrak, G.: The application of chordal graphs to inferring phylogenetic trees of languages. In: Fifth International Joint Conference on Natural Language Processing, IJCNLP, pp. 545–552 (2011)Google Scholar
  9. 9.
    Eppstein, D., Löffler, M., Strash, D.: Listing all maximal cliques in sparse graphs in near-optimal time. In: Cheong, O., Chwa, K.-Y., Park, K. (eds.) ISAAC 2010. LNCS, vol. 6506, pp. 403–414. Springer, Heidelberg (2010). doi: 10.1007/978-3-642-17517-6_36 CrossRefGoogle Scholar
  10. 10.
    Galinier, P., Habib, M., Paul, C.: Chordal graphs and their clique graphs. In: Nagl, M. (ed.) WG 1995. LNCS, vol. 1017, pp. 358–371. Springer, Heidelberg (1995). doi: 10.1007/3-540-60618-1_88 CrossRefGoogle Scholar
  11. 11.
    Gavril, F.: The intersection graphs of subtrees in trees are exactly the chordal graphs. J. Comb. Theor. Ser. B 16(1), 47–56 (1974)MathSciNetCrossRefMATHGoogle Scholar
  12. 12.
    Kuramochi, M., Karypis, G.: Frequent subgraph discovery. In: Proceedings IEEE International Conference on Data Mining, pp. 313–320. IEEE (2001)Google Scholar
  13. 13.
    Lee, V.E., Ruan, N., Jin, R., Aggarwal, C.: A survey of algorithms for dense subgraph discovery. In: Aggarwal, C.C., Wang, H. (eds.) Managing and Mining Graph Data, pp. 303–336. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  14. 14.
    Lukot’ka, R., Mazák, J., Zhu, X.: Maximum 4-degenerate subgraph of a planar graph. Electron. J. Comb. 22(1), P1–11 (2015)MathSciNetMATHGoogle Scholar
  15. 15.
    Nešetřil, J., Ossona de Mendez, P.: Sparsity: Graphs, Structures, and Algorithms. Algorithms and Combinatorics, vol. 28. Springer, Heidelberg (2012)Google Scholar
  16. 16.
    Pilipczuk, M., Pilipczuk, M.: Finding a maximum induced degenerate subgraph faster than 2n. In: Thilikos, D.M., Woeginger, G.J. (eds.) IPEC 2012. LNCS, vol. 7535, pp. 3–12. Springer, Heidelberg (2012). doi: 10.1007/978-3-642-33293-7_3 CrossRefGoogle Scholar
  17. 17.
    Rose, D.J., Tarjan, R.E., Lueker, G.S.: Algorithmic aspects of vertex elimination on graphs. SIAM J. Comput. 5(2), 266–283 (1976)MathSciNetCrossRefMATHGoogle Scholar
  18. 18.
    Tarjan, R.E., Yannakakis, M.: Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs. SIAM J. Comput. 13(3), 566–579 (1984)MathSciNetCrossRefMATHGoogle Scholar
  19. 19.
    Ugander, J., Karrer, B., Backstrom, L., Marlow, C.: The anatomy of the facebook social graph. arXiv preprint arXiv: 1111.4503 (2011)
  20. 20.
    Wasa, K.: Enumeration of enumeration algorithms. arXiv preprint arXiv:1605.05102 (2016)
  21. 21.
    Wasa, K., Arimura, H., Uno, T.: Efficient enumeration of induced subtrees in a K-degenerate graph. In: Ahn, H.-K., Shin, C.-S. (eds.) ISAAC 2014. LNCS, vol. 8889, pp. 94–102. Springer, Cham (2014). doi: 10.1007/978-3-319-13075-0_8 Google Scholar

Copyright information

© Springer International Publishing AG 2017

Authors and Affiliations

  • Alessio Conte
    • 1
  • Mamadou Moustapha Kanté
    • 2
  • Yota Otachi
    • 3
  • Takeaki Uno
    • 4
  • Kunihiro Wasa
    • 4
  1. 1.Università di PisaPisaItaly
  2. 2.Université Clermont Auvergne, LIMOS, CNRSAubièreFrance
  3. 3.Kumamoto UniversityKumamotoJapan
  4. 4.National Institute of InformaticsTokyoJapan

Personalised recommendations