{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T08:47:06Z","timestamp":1770972426698,"version":"3.50.1"},"publisher-location":"Cham","reference-count":60,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031754081","type":"print"},{"value":"9783031754098","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-3-031-75409-8_4","type":"book-chapter","created":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T22:10:20Z","timestamp":1737497420000},"page":"50-64","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Enumerating Minimal Solution Sets for\u00a0Metric Graph Problems"],"prefix":"10.1007","author":[{"given":"Benjamin","family":"Bergougnoux","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Oscar","family":"Defrain","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fionn","family":"Mc Inerney","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,1,22]]},"reference":[{"key":"4_CR1","unstructured":"Abu-Khzam, F.N., Fernau, H., Gras, B., Liedloff, M., Mann, K.: Enumerating minimal connected dominating sets. In: 30th Annual European Symposium on Algorithms (ESA 2022). Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik (2022)"},{"key":"4_CR2","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1016\/j.tcs.2015.11.031","volume":"658","author":"KV Adaricheva","year":"2017","unstructured":"Adaricheva, K.V., Nation, J.B.: Discovery of the D-basis in binary tables based on hypergraph dualization. Theoret. Comput. Sci. 658, 307\u2013315 (2017)","journal-title":"Theoret. Comput. Sci."},{"key":"4_CR3","doi-asserted-by":"publisher","first-page":"1045","DOI":"10.4171\/dm\/421","volume":"18","author":"I Agol","year":"2013","unstructured":"Agol, I.: The virtual Haken conjecture (with an appendix by Ian Agol, Daniel Groves and Jason Manning). Doc. Math. 18, 1045\u20131087 (2013)","journal-title":"Doc. Math."},{"issue":"10","key":"4_CR4","doi-asserted-by":"publisher","first-page":"112985","DOI":"10.1016\/j.disc.2022.112985","volume":"345","author":"J Ahn","year":"2022","unstructured":"Ahn, J., Jaffke, L., Kwon, O., Lima, P.T.: Well-partitioned chordal graphs. Discret. Math. 345(10), 112985 (2022)","journal-title":"Discret. Math."},{"key":"4_CR5","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/j.jcta.2018.01.002","volume":"156","author":"H-J Bandelt","year":"2018","unstructured":"Bandelt, H.-J., Chepoi, V., Knauer, K.: COMs: complexes of oriented matroids. J. Comb. Theory Ser. A 156, 195\u2013237 (2018)","journal-title":"J. Comb. Theory Ser. A"},{"issue":"3","key":"4_CR6","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1016\/1055-7903(92)90021-8","volume":"1","author":"H-J Bandelt","year":"1992","unstructured":"Bandelt, H.-J., Dress, A.W.M.: Split decomposition: a new and useful approach to phylogenetic analysis of distance data. Mol. Phylogenet. Evol. 1(3), 242\u2013252 (1992)","journal-title":"Mol. Phylogenet. Evol."},{"issue":"12","key":"4_CR7","doi-asserted-by":"publisher","first-page":"2168","DOI":"10.1109\/JSAC.2006.884015","volume":"24","author":"Z Beerliova","year":"2006","unstructured":"Beerliova, Z., et al.: Network discovery and verification. IEEE J. Sel. Area Commun. 24(12), 2168\u20132181 (2006)","journal-title":"IEEE J. Sel. Area Commun."},{"issue":"10","key":"4_CR8","doi-asserted-by":"publisher","first-page":"2867","DOI":"10.1007\/s00453-020-00707-5","volume":"82","author":"J Bensmail","year":"2020","unstructured":"Bensmail, J., Mazauric, D., Mc Inerney, F., Nisse, N., P\u00e9rennes, S.: Sequential metric dimension. Algorithmica 82(10), 2867\u20132901 (2020)","journal-title":"Algorithmica"},{"key":"4_CR9","volume-title":"Hypergraphs: Combinatorics of Finite Sets","author":"C Berge","year":"1984","unstructured":"Berge, C.: Hypergraphs: Combinatorics of Finite Sets, vol. 45. Elsevier, Amsterdam (1984)"},{"key":"4_CR10","unstructured":"Bergougnoux, B., Defrain, O., Mc\u00a0Inerney, F.: Enumerating minimal solution sets for metric graph problems. arXiv preprint arXiv:2309.17419 (2023)"},{"key":"4_CR11","doi-asserted-by":"crossref","unstructured":"Birkhoff, G.: Lattice Theory, vol. 25. American Mathematical Society (1940)","DOI":"10.1090\/coll\/025"},{"key":"4_CR12","unstructured":"Bodlaender, H., Boros, E., Heggernes, P., Kratsch, D.: Open problems of the Lorentz workshop, \u201cEnumeration algorithms using structure\u201d. Department of Information and Computing Sciences Utrecht University, Utrecht, The Netherlands (2015)"},{"issue":"3","key":"4_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3386686","volume":"16","author":"M Bonamy","year":"2020","unstructured":"Bonamy, M., Defrain, O., Heinrich, M., Pilipczuk, M., Raymond, J.-F.: Enumerating minimal dominating sets in $${K}_t$$-free and variants. ACM Trans. Algorithms 16(3), 1\u201323 (2020)","journal-title":"ACM Trans. Algorithms"},{"key":"4_CR14","doi-asserted-by":"crossref","unstructured":"Bonamy, M., Defrain, O., Micek, P., Nourine, L.: Enumerating minimal dominating sets in the (in)comparability graphs of bounded dimension posets. arXiv preprint arXiv:2004.07214 (2020)","DOI":"10.1145\/3386686"},{"key":"4_CR15","unstructured":"Capelli, F., Strozecki, Y.: Geometric amortization of enumeration algorithms. In: 40th International Symposium on Theoretical Aspects of Computer Science (STACS 2023). LIPIcs, vol. 254, pp. 18:1\u201318:22. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2023)"},{"key":"4_CR16","unstructured":"Chakraborty, D., Das, S., Foucaud, F., Gahlawat, H., Lajou, D., Roy, B.: Algorithms and complexity for geodetic Sets on planar and chordal graphs. In: 31st International Symposium on Algorithms and Computation (ISAAC 2020). LIPIcs. Schloss Dagstuhl\u2013Leibniz-Zentrum f\u00fcr Informatik (2020)"},{"key":"4_CR17","unstructured":"Chakraborty, D., Foucaud, F., Majumdar, D., Tale, P.: Tight (double) exponential bounds for identification problems: locating-dominating set and test cover. arXiv preprint arXiv:2402.08346 (2024)"},{"key":"4_CR18","doi-asserted-by":"crossref","unstructured":"Chalopin, J., Chepoi, V., Mc\u00a0Inerney, F., Ratel, S.: Non-clashing teaching maps for balls in graphs. In: Proceedings of the 37th Annual Conference on Learning Theory (COLT 2024) (2024)","DOI":"10.1137\/22M1527817"},{"key":"4_CR19","unstructured":"Chandran, S., Issac, D., Karrenbauer, A.: On the parameterized complexity of biclique cover and partition. In: 11th International Symposium on Parameterized and Exact Computation (IPEC 2016). LIPIcs, vol.\u00a063, pp. 11:1\u201311:13. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2016)"},{"key":"4_CR20","unstructured":"Conte, A., Grossi, R., Kant\u00e9, M.M., Marino, A., Uno, T., Wasa, K.: Listing induced steiner subgraphs as a compact way to discover steiner trees in graphs. In: 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2019)"},{"key":"4_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1007\/978-3-030-25005-8_13","volume-title":"Combinatorial Algorithms","author":"A Conte","year":"2019","unstructured":"Conte, A., Kant\u00e9, M.M., Marino, A., Uno, T.: Maximal irredundant set enumeration in bounded-degeneracy and bounded-degree hypergraphs. In: Colbourn, C.J., Grossi, R., Pisanti, N. (eds.) IWOCA 2019. LNCS, vol. 11638, pp. 148\u2013159. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-25005-8_13"},{"issue":"12","key":"4_CR22","doi-asserted-by":"publisher","first-page":"2675","DOI":"10.1016\/j.dam.2008.08.021","volume":"157","author":"B Courcelle","year":"2009","unstructured":"Courcelle, B.: Linear delay enumeration and monadic second-order logic. Discret. Appl. Math. 157(12), 2675\u20132700 (2009)","journal-title":"Discret. Appl. Math."},{"issue":"1","key":"4_CR23","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1137\/130947076","volume":"45","author":"M Cygan","year":"2016","unstructured":"Cygan, M., Pilipczuk, M., Pilipczuk, M.: Known algorithms for edge clique cover are probably optimal. SIAM J. Comput. 45(1), 67\u201383 (2016)","journal-title":"SIAM J. Comput."},{"key":"4_CR24","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/j.tcs.2020.01.028","volume":"814","author":"O Defrain","year":"2020","unstructured":"Defrain, O., Nourine, L.: Dualization in lattices given by implicational bases. Theoret. Comput. Sci. 814, 169\u2013176 (2020)","journal-title":"Theoret. Comput. Sci."},{"issue":"7","key":"4_CR25","doi-asserted-by":"publisher","first-page":"112399","DOI":"10.1016\/j.disc.2021.112399","volume":"344","author":"O Defrain","year":"2021","unstructured":"Defrain, O., Nourine, L., Vilmin, S.: Translating between the representations of a ranked convex geometry. Discret. Math. 344(7), 112399 (2021)","journal-title":"Discret. Math."},{"issue":"1","key":"4_CR26","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1016\/j.jcss.2016.06.006","volume":"83","author":"J D\u00edaz","year":"2017","unstructured":"D\u00edaz, J., Pottonen, O., Serna, M., van Leeuwen, E.J.: Complexity of metric dimension on planar graphs. J. Comput. Syst. Sci. 83(1), 132\u2013158 (2017)","journal-title":"J. Comput. Syst. Sci."},{"key":"4_CR27","doi-asserted-by":"crossref","unstructured":"Diestel, R.: Graph Theory. Graduate Texts in Mathematics, vol. 173. Springer (2012)","DOI":"10.1007\/978-3-662-53622-3_7"},{"issue":"6","key":"4_CR28","doi-asserted-by":"publisher","first-page":"1278","DOI":"10.1137\/S0097539793250299","volume":"24","author":"T Eiter","year":"1995","unstructured":"Eiter, T., Gottlob, G.: Identifying the minimal transversals of a hypergraph and related problems. SIAM J. Comput. 24(6), 1278\u20131304 (1995)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"4_CR29","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1137\/S009753970240639X","volume":"32","author":"T Eiter","year":"2003","unstructured":"Eiter, T., Gottlob, G., Makino, K.: New results on monotone dualization and generating hypergraph transversals. SIAM J. Comput. 32(2), 514\u2013537 (2003)","journal-title":"SIAM J. Comput."},{"issue":"11","key":"4_CR30","doi-asserted-by":"publisher","first-page":"2035","DOI":"10.1016\/j.dam.2007.04.017","volume":"156","author":"T Eiter","year":"2008","unstructured":"Eiter, T., Makino, K., Gottlob, G.: Computational aspects of monotone dualization: a brief survey. Discret. Appl. Math. 156(11), 2035\u20132049 (2008)","journal-title":"Discret. Appl. Math."},{"key":"4_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/978-3-642-29344-3_24","volume-title":"LATIN 2012: Theoretical Informatics","author":"T Ekim","year":"2012","unstructured":"Ekim, T., Erey, A., Heggernes, P., van \u2019t Hof, P., Meister, D.: Computing minimum geodetic sets of proper interval graphs. In: Fern\u00e1ndez-Baca, D. (ed.) LATIN 2012. LNCS, vol. 7256, pp. 279\u2013290. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29344-3_24"},{"key":"4_CR32","doi-asserted-by":"crossref","unstructured":"Elbassioni, K.: On dualization over distributive lattices. Discrete Math. Theor. Comput. Sci. 24(Discrete Algorithms) (2022)","DOI":"10.46298\/dmtcs.6742"},{"key":"4_CR33","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1016\/j.tcs.2018.09.027","volume":"767","author":"K Elbassioni","year":"2019","unstructured":"Elbassioni, K., Rauf, I., Ray, S.: A global parallel algorithm for enumerating minimal transversals of geometric hypergraphs. Theoret. Comput. Sci. 767, 26\u201333 (2019)","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"4_CR34","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1137\/050622250","volume":"23","author":"KM Elbassioni","year":"2009","unstructured":"Elbassioni, K.M.: Algorithms for dualization over products of partially ordered sets. SIAM J. Discrete Math. 23(1), 487\u2013510 (2009)","journal-title":"SIAM J. Discrete Math."},{"issue":"4","key":"4_CR35","doi-asserted-by":"publisher","first-page":"1130","DOI":"10.1007\/s00453-014-9896-2","volume":"72","author":"L Epstein","year":"2015","unstructured":"Epstein, L., Levin, A., Woeginger, G.J.: The (weighted) metric dimension of graphs: hard and easy cases. Algorithmica 72(4), 1130\u20131171 (2015)","journal-title":"Algorithmica"},{"key":"4_CR36","unstructured":"Foucaud, F., et al.: Metric dimension and geodetic set parameterized by vertex cover. arXiv preprint arXiv:2405.01344 (2024)"},{"key":"4_CR37","unstructured":"Foucaud, F., et al.: Problems in NP can admit double-exponential lower bounds when parameterized by treewidth or vertex cover. In: Proceedings of the 51st International Colloquium on Automata, Languages and Programming (ICALP 2024) (2024)"},{"key":"4_CR38","doi-asserted-by":"publisher","first-page":"914","DOI":"10.1007\/s00453-016-0184-1","volume":"78","author":"F Foucaud","year":"2017","unstructured":"Foucaud, F., Mertzios, G.B., Naserasr, R., Parreau, A., Valicov, P.: Identification, location-domination and metric dimension on interval and permutation graphs. II. Algorithms and complexity. Algorithmica 78, 914\u2013944 (2017)","journal-title":"Algorithmica"},{"issue":"3","key":"4_CR39","doi-asserted-by":"publisher","first-page":"618","DOI":"10.1006\/jagm.1996.0062","volume":"21","author":"ML Fredman","year":"1996","unstructured":"Fredman, M.L., Khachiyan, L.: On the complexity of dualization of monotone disjunctive normal forms. J. Algorithms 21(3), 618\u2013628 (1996)","journal-title":"J. Algorithms"},{"key":"4_CR40","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman (1979)"},{"issue":"2","key":"4_CR41","doi-asserted-by":"publisher","first-page":"714","DOI":"10.1007\/s00453-017-0289-1","volume":"80","author":"PA Golovach","year":"2018","unstructured":"Golovach, P.A., Heggernes, P., Kant\u00e9, M.M., Kratsch, D., S\u00e6ther, S.H., Villanger, Y.: Output-polynomial enumeration on graphs of bounded (local) linear MIM-width. Algorithmica 80(2), 714\u2013741 (2018)","journal-title":"Algorithmica"},{"key":"4_CR42","first-page":"191","volume":"2","author":"F Harary","year":"1976","unstructured":"Harary, F., Melter, R.A.: On the metric dimension of a graph. Ars Combin. 2, 191\u2013195 (1976)","journal-title":"Ars Combin."},{"issue":"11","key":"4_CR43","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/0895-7177(93)90259-2","volume":"17","author":"F Harary","year":"1993","unstructured":"Harary, F., Loukakis, E., Tsouros, C.: The geodetic number of a graph. Math. Comput. Model. 17(11), 89\u201395 (1993)","journal-title":"Math. Comput. Model."},{"issue":"3","key":"4_CR44","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/0020-0190(88)90065-8","volume":"27","author":"DS Johnson","year":"1988","unstructured":"Johnson, D.S., Yannakakis, M., Papadimitriou, C.H.: On generating all maximal independent sets. Inf. Process. Lett. 27(3), 119\u2013123 (1988)","journal-title":"Inf. Process. Lett."},{"key":"4_CR45","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1080\/10543409308835060","volume":"3","author":"M Johnson","year":"1993","unstructured":"Johnson, M.: Structure-activity maps for visualizing the graph variables arising in drug design. J. Biopharm. Statist. 3, 203\u2013236 (1993)","journal-title":"J. Biopharm. Statist."},{"key":"4_CR46","unstructured":"Kant\u00e9, M.M., Khoshkhah, K., Pourmoradnasseri, M.: Enumerating minimal transversals of hypergraphs without small holes. In: 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2018)"},{"issue":"4","key":"4_CR47","doi-asserted-by":"publisher","first-page":"1916","DOI":"10.1137\/120862612","volume":"28","author":"MM Kant\u00e9","year":"2014","unstructured":"Kant\u00e9, M.M., Limouzy, V., Mary, A., Nourine, L.: On the enumeration of minimal dominating sets and related notions. SIAM J. Discret. Math. 28(4), 1916\u20131929 (2014)","journal-title":"SIAM J. Discret. Math."},{"key":"4_CR48","doi-asserted-by":"crossref","unstructured":"Kant\u00e9, M.M., Limouzy, V., Mary, A., Nourine, L., Uno, T.: A polynomial delay algorithm for enumerating minimal dominating sets in chordal graphs. In: International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2015), pp. 138\u2013153. Springer (2015)","DOI":"10.1007\/978-3-662-53174-7_11"},{"issue":"1","key":"4_CR49","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1137\/15M1013389","volume":"30","author":"MM Kant\u00e9","year":"2016","unstructured":"Kant\u00e9, M.M., Nourine, L.: Polynomial time algorithms for computing a minimum hull set in distance-hereditary and chordal graphs. SIAM J. Discret. Math. 30(1), 311\u2013326 (2016)","journal-title":"SIAM J. Discret. Math."},{"issue":"2","key":"4_CR50","doi-asserted-by":"publisher","first-page":"599","DOI":"10.1109\/18.661507","volume":"44","author":"MG Karpovsky","year":"1998","unstructured":"Karpovsky, M.G., Chakrabarty, K., Levitin, L.B.: On a new class of codes for identifying vertices in graphs. IEEE Trans. Information Theory 44(2), 599\u2013611 (1998)","journal-title":"IEEE Trans. Information Theory"},{"issue":"2","key":"4_CR51","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1016\/j.tcs.2007.03.005","volume":"382","author":"L Khachiyan","year":"2007","unstructured":"Khachiyan, L., Boros, E., Elbassioni, K., Gurvich, V.: On the dualization of hypergraphs with bounded edge-intersections and other related classes of hypergraphs. Theoret. Comput. Sci. 382(2), 139\u2013150 (2007)","journal-title":"Theoret. Comput. Sci."},{"key":"4_CR52","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/j.tcs.2018.05.032","volume":"745","author":"M Mezzini","year":"2018","unstructured":"Mezzini, M.: Polynomial time algorithm for computing a minimum geodetic set in outerplanar graphs. Theoret. Comput. Sci. 745, 63\u201374 (2018)","journal-title":"Theoret. Comput. Sci."},{"issue":"3","key":"4_CR53","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1016\/j.dam.2006.06.009","volume":"155","author":"OR Oellermann","year":"2007","unstructured":"Oellermann, O.R., Peters-Fransen, J.: The strong metric dimension of graphs and digraphs. Discret. Appl. Math. 155(3), 356\u2013364 (2007)","journal-title":"Discret. Appl. Math."},{"issue":"2","key":"4_CR54","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1287\/moor.1030.0070","volume":"29","author":"A Seb\u0151","year":"2004","unstructured":"Seb\u0151, A., Tannier, E.: On metric generators of graphs. Math. Oper. Res. 29(2), 383\u2013393 (2004)","journal-title":"Math. Oper. Res."},{"key":"4_CR55","unstructured":"Slater, P.J.: Leaves of trees. In: Proceedings of the Sixth Southeastern Conference on Combinatorics, Graph Theory, and Computing, pp. 549\u2013559. Congressus Numerantium, No. XIV. Utilitas Mathematica (1975)"},{"issue":"1","key":"4_CR56","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1002\/net.3230170105","volume":"17","author":"PJ Slater","year":"1987","unstructured":"Slater, P.J.: Domination and location in acyclic graphs. Networks 17(1), 55\u201364 (1987)","journal-title":"Networks"},{"key":"4_CR57","unstructured":"Strozecki, Y.: Enumeration complexity. Bull. EATCS 1(129) (2019)"},{"issue":"1","key":"4_CR58","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00285-019-01348-1","volume":"79","author":"RC Tillquist","year":"2019","unstructured":"Tillquist, R.C., Lladser, M.E.: Low-dimensional representation of genomic sequences. J. Math. Biol. 79(1), 1\u201329 (2019). https:\/\/doi.org\/10.1007\/s00285-019-01348-1","journal-title":"J. Math. Biol."},{"issue":"3","key":"4_CR59","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1137\/0206036","volume":"6","author":"S Tsukiyama","year":"1977","unstructured":"Tsukiyama, S., Ide, M., Ariyoshi, H., Shirakawa, I.: A new algorithm for generating all the maximal independent sets. SIAM J. Comput. 6(3), 505\u2013517 (1977)","journal-title":"SIAM J. Comput."},{"key":"4_CR60","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1016\/j.tcs.2016.03.018","volume":"658","author":"M Wild","year":"2017","unstructured":"Wild, M.: The joy of implications, aka pure horn formulas: mainly a survey. Theoret. Comput. Sci. 658, 264\u2013292 (2017)","journal-title":"Theoret. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-75409-8_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T22:10:26Z","timestamp":1737497426000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-75409-8_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031754081","9783031754098"],"references-count":60,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-75409-8_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"22 January 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WG","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Graph-Theoretic Concepts in Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Gozd Martuljek","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Slovenia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 June 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 June 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"50","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wg2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/conferences.famnit.upr.si\/event\/31\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}