Skip to main content
Log in

Output-Polynomial Enumeration on Graphs of Bounded (Local) Linear MIM-Width

  • Published:
Algorithmica Aims and scope Submit manuscript

Abstract

The linear induced matching width (LMIM-width) of a graph is a width parameter defined by using the notion of branch-decompositions of a set function on ternary trees. In this paper we study output-polynomial enumeration algorithms on graphs of bounded LMIM-width and graphs of bounded local LMIM-width. In particular, we show that all 1-minimal and all 1-maximal \((\sigma ,\rho )\)-dominating sets, and hence all minimal dominating sets, of graphs of bounded LMIM-width can be enumerated with polynomial (linear) delay using polynomial space. Furthermore, we show that all minimal dominating sets of a unit square graph can be enumerated in incremental polynomial time.

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

Access this article

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

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2

Similar content being viewed by others

Notes

  1. The original statement dealt with un-colored graphs, however it is not hard to extend it to colored graphs.

References

  1. Avis, D., Fukuda, K.: Reverse search for enumeration. Discrete Appl. Math. 65(1–3), 21–46 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  2. Demaine, E.D., Fomin, F.V., Hajiaghayi, M., Thilikos, D.M.: Bidimensional parameters and local treewidth. SIAM J. Discrete Math. 18(3), 501–511 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  3. Demaine, E.D., Hajiaghayi, M., Thilikos, D.M.: The bidimensional theory of bounded-genus graphs. SIAM J. Discrete Math. 20(2), 357–371 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  4. Belmonte, R., Vatshelle, M.: Graph classes with structured neighborhoods and algorithmic applications. Theor. Comput. Sci. 511, 54–65 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  5. Brandstädt, A., Le, V.B., Spinrad, J.P.: Graph classes: a survey. In: SIAM Monographs on Discrete Mathematics and Applications. SIAM, Philadelphia (1999)

  6. Breu, H.: Algorithmic Aspects of Constrained Unit Disk Graphs. Ph.D. thesis, The University of British Columbia (1996)

  7. Bui-Xuan, B.M., Telle, J.A., Vatshelle, M.: Fast dynamic programming for locally checkable vertex subset and vertex partitioning problems. Theor. Comput. Sci. 511, 66–76 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  8. Chandran, L.S., Francis, M.C., Sivadasan, N.: On the cubicity of interval graphs. Graphs Comb. 25(2), 169–179 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  9. Courcelle, B.: Linear delay enumeration and monadic second-order logic. Discrete Appl. Math. 157, 2675–2700 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  10. Eiter, T., Gottlob, G.: Identifying the minimal transversals of a hypergraph and related problems. SIAM J. Comput. 24, 1278–1304 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  11. Eiter, T., Gottlob, G.: Hypergraph transversal computation and related problems in logic and AI. In: Proceedings of the JELIA 2002. LNCS, vol. 2424, pp. 549–564 (2002)

  12. Eiter, T., Gottlob, G., Makino, K.: New results on monotone dualization and generating hypergraph transversals. SIAM J. Comput. 32, 514–537 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  13. Golovach, P.A., Heggernes, P., Kratsch, D., Villanger, Y.: An incremental polynomial time algorithm to enumerate all minimal edge dominating sets. Algorithmica 72, 836–859 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  14. Golovach, P.A., Heggernes, P., Kanté, M.M., Kratsch, D., Villanger, Y.: Enumerating minimal dominating sets in chordal bipartite graphs. Discrete Appl. Math. 166, 30–35 (2016)

    Article  MathSciNet  MATH  Google Scholar 

  15. Johnson, D.S., Papadimitriou, C.H., Yannakakis, M.: On generating all maximal independent sets. Inf. Process. Lett. 27(3), 119–123 (1988)

    Article  MathSciNet  MATH  Google Scholar 

  16. Kanté, M.M., Limouzy, V., Mary, A., Nourine, L.: On the enumeration of minimal dominating sets and related notions. SIAM J. Discrete Math. 28, 1916–1929 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  17. Kanté, M.M., Limouzy, V., Mary, A., Nourine, L.: On the neighbourhood helly of some graph classes and applications to the enumeration of minimal dominating sets. In: Proceedings of the ISAAC 2012. LNCS, vol. 7676, pp. 289–298 (2012)

  18. Kanté, M.M., Limouzy, V., Mary, A., Nourine, L., Uno, T.: On the enumeration and counting of minimal dominating sets in interval and permutation graphs. In: Proceedings of the ISAAC 2013. LNCS, vol. 8283, pp. 339–349 (2013)

  19. Kanté, M.M., Limouzy, V., Mary, A., Nourine, L., Uno, T.: A polynomial delay algorithm for enumerating minimal dominating sets in chordal graphs. In: Proceedings of the WG 2015. LNCS, vol. 9224, pp. 138–153 (2015)

  20. Kanté, M.M., Limouzy, V., Mary, A., Nourine, L., Uno, T.: Polynomial delay algorithm for listing minimal edge dominating sets in graphs. In: Proceedings of the WADS 2015, LNCS, vol. 9214, pp. 446–357 (2015)

  21. Khachiyan, L., Boros, E., Borys, K., Elbassioni, K.M., Gurvich, V.: Generating all vertices of a polyhedron is hard. Discrete Comput. Geom. 39, 174–190 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  22. Khachiyan, L., Boros, E., Elbassioni, K.M., Gurvich, V.: On enumerating minimal dicuts and strongly connected subgraphs. Algorithmica 50, 159–172 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  23. Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G.: Generating all maximal independent sets. SIAM J. Comput. 9, 558–565 (1980)

    Article  MathSciNet  MATH  Google Scholar 

  24. Rauf, I.: Polynomially Solvable Cases of Hypergraph Transversal and Related Problems. Ph.D. thesis, Saarland University (2011)

  25. Tarjan, R.E.: Enumeration of the elementary circuits of a directed graph. SIAM J. Comput. 2, 211–216 (1973)

    Article  MathSciNet  MATH  Google Scholar 

  26. Telle, J.A., Proskurowski, A.: Algorithms for vertex partitioning problems on partial \(k\)-trees. SIAM J. Discrete Math. 10(4), 529–550 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  27. Vatshelle, M.: New Width Parameters of Graphs. Ph.D. thesis, University of Bergen (2012)

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Petr A. Golovach.

Additional information

A preliminary version of this paper appeared as an extended abstract in the proceedings of ISAAC 2015. The research leading to these results has received funding from the European Research Council under the European Union’s Seventh Framework Programme (FP/2007-2013) / ERC Grant Agreement No. 267959. M.M. Kanté and D. Kratsch are supported by French Agency for Research under the GraphEn Project (ANR-15-CE-0009).

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Golovach, P.A., Heggernes, P., Kanté, M.M. et al. Output-Polynomial Enumeration on Graphs of Bounded (Local) Linear MIM-Width. Algorithmica 80, 714–741 (2018). https://doi.org/10.1007/s00453-017-0289-1

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00453-017-0289-1

Keywords

Navigation