Abstract
We show that all minimal edge dominating sets of a graph can be generated in incremental polynomial time. We present an algorithm that solves the equivalent problem of enumerating minimal (vertex) dominating sets of line graphs in incremental polynomial, and consequently output polynomial, time. Enumeration of minimal dominating sets in graphs has very recently been shown to be equivalent to enumeration of minimal transversals in hypergraphs. The question whether the minimal transversals of a hypergraph can be enumerated in output polynomial time is a fundamental and challenging question; it has been open for several decades and has triggered extensive research. To obtain our result, we present a flipping method to generate all minimal dominating sets of a graph. Its basic idea is to apply a flipping operation to a minimal dominating set D * to generate minimal dominating sets D such that G[D] contains more edges than G[D *]. We show that the flipping method works efficiently on line graphs, resulting in an algorithm with delay \(O(n^2m^2|\mathcal{L}|)\) between each pair of consecutively output minimal dominating sets, where n and m are the numbers of vertices and edges of the input graph, respectively, and \(\mathcal{L}\) is the set of already generated minimal dominating sets. Furthermore, we are able to improve the delay to \(O(n^2 m|\mathcal{L}|)\) on line graphs of bipartite graphs. Finally we show that the flipping method is also efficient on graphs of large girth, resulting in an incremental polynomial time algorithm to enumerate the minimal dominating sets of graphs of girth at least 7.
This work is supported by the European Research Council, the Research Council of Norway, and the French National Research Agency. Due the space restrictions, proofs of various claims are omitted. The complete version of the paper can be found on-line in [13].
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Avis, D., Fukuda, K.: Reverse search for enumeration. Discrete Applied Mathematics 65, 21–46 (1996)
Boros, E., Elbassioni, K., Gurvich, V.: Transversal hypergraphs to perfect matchings in bipartite graphs: characterization and generation algorithms. Journal of Graph Theory 53, 209–232 (2006)
Boros, E., Gurvich, V., Hammer, P.L.: Dual subimplicants of positive boolean functions. Optimization Methods & Software 10, 147–156 (1998)
Boros, E., Hammer, P.L., Ibaraki, T., Kawakami, K.: Polynomial time recognition of 2-monotonic positive Boolean functions given by an oracle. SIAM Journal on Computing 26, 93–109 (1997)
Courcelle, B.: Linear delay enumeration and monadic second-order logic. Discrete Applied Mathematics 157, 2675–2700 (2009)
Domingo, C., Mishra, N., Pitt, L.: Efficient read-restricted monotone cnf/dnf dualization by learning with membership queries. Machine Learning 37, 89–110 (1999)
Eiter, T.: Exact transversal hypergraphs and application to Boolean μ-functions. Journal of Symbolic Computing 17, 215–225 (1994)
Eiter, T., Gottlob, G.: Identifying the minimal transversals of a hypergraph and related problems. SIAM Journal on Computing 24, 1278–1304 (1995)
Eiter, T., Gottlob, G.: Hypergraph transversal computation and related problems in logic and AI. In: Flesca, S., Greco, S., Leone, N., Ianni, G. (eds.) JELIA 2002. LNCS (LNAI), vol. 2424, pp. 549–564. Springer, Heidelberg (2002)
Eiter, T., Gottlob, G., Makino, K.: New results on monotone dualization and generating hypergraph transversals. SIAM Journal on Computing 32, 514–537 (2003) (Preliminary version in STOC 2002)
Schwikowski, B., Speckenmeyer, E.: On enumerating all minimal solutions of feedback problems. ESA 2009 117, 253–265 (2002)
Fredman, M.L., Khachiyan, L.: On the complexity of dualization of monotone disjunctive normal forms. Journal of Algorithms 21, 618–628 (1996)
Golovach, P.A., Heggernes, P., Kratsch, D., Villanger, Y.: Generating all minimal edge dominating sets with incremental-polynomial delay. CoRR, abs/1208.5345 (2012)
Haynes, T.W., Hedetniemi, S.T.: Domination in graphs. Marcel Dekker Inc., New York (1998)
Hemminger, R.L., Beineke, L.W.: Line graphs and line digraphs. In: Beineke, L.W., Wilson, R.J. (eds.) Selected Topics in Graph Theory, pp. 271–305. Academic Press (1978)
Johnson, S., Papadimitriou, C.H., Yannakakis, M.: On generating all maximal independent sets. Information Processing Letters 27, 119–123 (1988)
Kanté, M.M., Limouzy, V., Mary, A., Nourine, L.: Enumeration of minimal dominating sets and variants. In: Owe, O., Steffen, M., Telle, J.A. (eds.) FCT 2011. LNCS, vol. 6914, pp. 298–309. Springer, Heidelberg (2011)
Kanté, M.M., Limouzy, V., Mary, A., Nourine, L.: On the enumeration of minimal dominating sets and related notions (submitted for journal publication), http://www.isima.fr/~kante/research.php
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.-S., Lee, D.-T. (eds.) ISAAC 2012. LNCS, vol. 7676, pp. 289–298. Springer, Heidelberg (2012)
Khachiyan, L., Boros, E., Borys, K., Elbassioni, K.M., Gurvich, V.: Generating all vertices of a polyhedron is hard. Discrete & Computational Geometry 39, 174–190 (2008)
Khachiyan, L., Boros, L., Borys, K., Elbassioni, K.M., Gurvich, V., Makino, K.: Generating Cut Conjunctions in Graphs and Related Problems. lgorithmica 51, 239–263 (2008)
Khachiyan, L., Boros, E., Elbassioni, K.M., Gurvich, V.: On enumerating minimal dicuts and strongly connected subgraphs. Algorithmica 50, 159–172 (2008)
Krausz, J.: Démonstration nouvelle d’un théorème de Whitney sur les réseaux. Mat. Fiz. Lapok 50, 75–85 (1943)
Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G.: Generating all maximal independent sets: NP-hardness and polynomial-time algorithms. SIAM Journal on Computing 9, 558–565 (1980)
Makino, K., Ibaraki, T.: The maximum latency and identification of positive Boolean functions. SIAM J. Comput. 26, 1363–1383 (1997)
Makino, K., Ibaraki, T.: A fast and simple algorithm for identifying 2-monotonic positive Boolean functions. Journal of Algorithms 26, 293–305 (1998)
Papadimitriou, C.: NP-completeness: A retrospective. In: Degano, P., Gorrieri, R., Marchetti-Spaccamela, A. (eds.) ICALP 1997. LNCS, vol. 1256, pp. 2–6. Springer, Heidelberg (1997)
Roussopoulos, N.D.: A max {m,n} algorithm for determining the graph H from its line graph G. Information Processing Letters 2, 108–112 (1973)
Schwikowski, B., Speckenmeyer, E.: On enumerating all minimal solutions of feedback problems. Discrete Applied Mathematics 117, 253–265 (2002)
Tarjan, R.E.: Enumeration of the elementary circuits of a directed graph. SIAM Journal on Computing 2, 211–216 (1973)
Tsukiyama, S., Ide, M., Ariyoshi, H., Shirakawa, I.: A new algorithm for generating all the maximal independent sets. SIAM Journal on Computing 6, 505–517 (1977)
Tsukiyama, S., Shirakawa, I., Ozaki, H., Ariyoshi, H.: An algorithm to enumerate all cutsets of a graph in linear time per cutset. Journal of the ACM 27, 619–632 (1980)
Whitney, H.: Congruent graphs and the connectivity of graphs. American Journal of Mathematics 54, 150–168 (1932)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Golovach, P.A., Heggernes, P., Kratsch, D., Villanger, Y. (2013). An Incremental Polynomial Time Algorithm to Enumerate All Minimal Edge Dominating Sets. In: Fomin, F.V., Freivalds, R., Kwiatkowska, M., Peleg, D. (eds) Automata, Languages, and Programming. ICALP 2013. Lecture Notes in Computer Science, vol 7965. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-39206-1_41
Download citation
DOI: https://doi.org/10.1007/978-3-642-39206-1_41
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-39205-4
Online ISBN: 978-3-642-39206-1
eBook Packages: Computer ScienceComputer Science (R0)