Abstract
It was proved independently and with different techniques in [Golovach et al. - ICALP 2013] and [Kanté et al. - ISAAC 2012] that there exists an incremental output polynomial algorithm for the enumeration of the minimal edge dominating sets in graphs, i.e., minimal dominating sets in line graphs. We provide the first polynomial delay and polynomial space algorithm for the problem. We propose a new technique to enlarge the applicability of Berge’s algorithm that is based on skipping hard parts of the enumeration by introducing a new search strategy. The new search strategy is given by a strong use of the structure of line graphs.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Avis, D., Fukuda, K.: Reverse search for enumeration. Discrete Applied Mathematics 65(1–3), 21–46 (1996)
Berge, C.: Hypergraphs: Combinatorics of Finite Sets. North-Holland (1989)
Boros, E., Elbassioni, K.M., Gurvich, V.: Transversal hypergraphs to perfect matchings in bipartite graphs: Characterization and generation algorithms. Journal of Graph Theory 53(3), 209–232 (2006)
Eiter, T., Gottlob, G.: Identifying the minimal transversals of a hypergraph and related problems. SIAM J. Comput. 24(6), 1278–1304 (1995)
Eiter, T., Gottlob, G., Makino, K.: New results on monotone dualization and generating hypergraph transversals. SIAM J. Comput. 32(2), 514–537 (2003)
Fomin, F.V., Heggernes, P., Kratsch, D., Papadopoulos, C., Villanger, Y.: Enumerating minimal subset feedback vertex sets. Algorithmica 69(1), 216–231 (2014)
Golovach, P.A., Heggernes, P., Kratsch, D., Villanger, Y.: An incremental polynomial time algorithm to enumerate all minimal edge dominating sets. In: Fomin, F.V., Freivalds, R., Kwiatkowska, M., Peleg, D. (eds.) ICALP 2013, Part I. LNCS, vol. 7965, pp. 485–496. Springer, Heidelberg (2013)
Gunopulos, D., Khardon, R., Mannila, H., Toivonen, H.: Data mining, hypergraph transversals, and machine learning. In: PODS, pp. 209–216 (1997)
Haynes, T.W., Hedetniemi, S.T., Slater, P.J.: Fundamentals of Domination in Graphs. Pure and Applied Mathematics, vol. 208. M. Dekker (1998)
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: Chao, K.-M., Hsu, T., Lee, D.-T. (eds.) ISAAC 2012. LNCS, vol. 7676, pp. 289–298. Springer, Heidelberg (2012)
Kanté, M.M., Limouzy, V., Mary, A., Nourine, L.: On the enumeration of minimal dominating sets and related notions. SIAM J. Discrete Math. 28(4), 1916–1929 (2014)
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: Cai, L., Cheng, S.-W., Lam, T.-W. (eds.) Algorithms and Computation. LNCS, vol. 8283, pp. 339–349. Springer, Heidelberg (2013)
Kavvadias, D.J., Stavropoulos, E.C.: An efficient algorithm for the transversal hypergraph generation. J. Graph Algorithms Appl. 9(2), 239–264 (2005)
Khachiyan, L., Boros, E., Borys, K., Elbassioni, K.M., Gurvich, V., Makino, K.: Generating cut conjunctions in graphs and related problems. Algorithmica 51(3), 239–263 (2008)
Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G.: Generating all maximal independent sets: np-hardness and polynomial-time algorithms. SIAM J. Comput. 9(3), 558–565 (1980)
Makino, K., Uno, T.: New algorithms for enumerating all maximal cliques. In: Hagerup, T., Katajainen, J. (eds.) SWAT 2004. LNCS, vol. 3111, pp. 260–272. Springer, Heidelberg (2004)
Murakami, K., Uno, T.: Efficient algorithms for dualizing large-scale hypergraphs. Discrete Applied Mathematics 170, 83–94 (2014)
Schwikowski, B., Speckenmeyer, E.: On enumerating all minimal solutions of feedback problems. Discrete Applied Mathematics 117(1–3), 253–265 (2002)
Shioura, A., Tamura, A., Uno, T.: An optimal algorithm for scanning all spanning trees of undirected graphs. SIAM J. Comput. 26(3), 678–692 (1997)
Strozecki, Y.: Enumeration Complexity and Matroid Decomposition. PhD thesis, Université Paris Diderot - Paris 7 (2010)
Takata, K.: A worst-case analysis of the sequential method to list the minimal hitting sets of a hypergraph. SIAM J. Discrete Math. 21(4), 936–946 (2007)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Kanté, M.M., Limouzy, V., Mary, A., Nourine, L., Uno, T. (2015). Polynomial Delay Algorithm for Listing Minimal Edge Dominating Sets in Graphs. In: Dehne, F., Sack, JR., Stege, U. (eds) Algorithms and Data Structures. WADS 2015. Lecture Notes in Computer Science(), vol 9214. Springer, Cham. https://doi.org/10.1007/978-3-319-21840-3_37
Download citation
DOI: https://doi.org/10.1007/978-3-319-21840-3_37
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-21839-7
Online ISBN: 978-3-319-21840-3
eBook Packages: Computer ScienceComputer Science (R0)