{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T16:01:11Z","timestamp":1725897671914},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642322402"},{"type":"electronic","value":"9783642322419"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-32241-9_12","type":"book-chapter","created":{"date-parts":[[2012,8,13]],"date-time":"2012-08-13T11:12:12Z","timestamp":1344856332000},"page":"133-144","source":"Crossref","is-referenced-by-count":3,"title":["Maximum Number of Minimal Feedback Vertex Sets in Chordal Graphs and Cographs"],"prefix":"10.1007","author":[{"given":"Jean-Fran\u00e7ois","family":"Couturier","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pinar","family":"Heggernes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pim","family":"van \u2019t Hof","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yngve","family":"Villanger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"12_CR1","doi-asserted-by":"crossref","unstructured":"Blair, J.R.S., Peyton, B.W.: An Introduction to Chordal Graphs and Clique Trees. In: Graph Theory and Sparse Matrix Computations. IMA Vol. in Math. Appl., vol.\u00a056, pp. 1\u201327. Springer","DOI":"10.1007\/978-1-4613-8369-7_1"},{"key":"12_CR2","doi-asserted-by":"crossref","unstructured":"Brandst\u00e4dt, A., Le, V.B., Spinrad, J.: Graph Classes: A Survey. Monographs on Discrete Mathematics and Applications (1999)","DOI":"10.1137\/1.9780898719796"},{"key":"12_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/978-3-642-10217-2_14","volume-title":"Combinatorial Algorithms","author":"B.M. Bui-Xuan","year":"2009","unstructured":"Bui-Xuan, B.M., Telle, J.A., Vatshelle, M.: Feedback Vertex Set on Graphs of low Cliquewidth. In: Fiala, J., Kratochv\u00edl, J., Miller, M. (eds.) IWOCA 2009. LNCS, vol.\u00a05874, pp. 113\u2013124. Springer, Heidelberg (2009)"},{"key":"12_CR4","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/0012-365X(74)90002-8","volume":"9","author":"P. Buneman","year":"1974","unstructured":"Buneman, P.: A characterization of rigid circuit graphs. Disc. Math.\u00a09, 205\u2013212 (1974)","journal-title":"Disc. Math."},{"key":"12_CR5","doi-asserted-by":"publisher","first-page":"926","DOI":"10.1137\/0214065","volume":"14","author":"D.G. Corneil","year":"1985","unstructured":"Corneil, D.G., Perl, Y., Stewart, L.: A linear recognition algorithm for cographs. SIAM J. Computing\u00a014, 926\u2013934 (1985)","journal-title":"SIAM J. Computing"},{"key":"12_CR6","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/0166-218X(88)90086-8","volume":"22","author":"D.G. Corneil","year":"1988","unstructured":"Corneil, D.G., Fonlupt, J.: The complexity of generalized clique covering. Disc. Appl. Math.\u00a022, 109\u2013118 (1988\/1989)","journal-title":"Disc. Appl. Math."},{"key":"12_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1007\/978-3-642-27660-6_17","volume-title":"SOFSEM 2012: Theory and Practice of Computer Science","author":"J.-F. Couturier","year":"2012","unstructured":"Couturier, J.-F., Heggernes, P., van \u2019t Hof, P., Kratsch, D.: Minimal Dominating Sets in Graph Classes: Combinatorial Bounds and Enumeration. In: Bielikov\u00e1, M., Friedrich, G., Gottlob, G., Katzenbeisser, S., Tur\u00e1n, G. (eds.) SOFSEM 2012. LNCS, vol.\u00a07147, pp. 202\u2013213. Springer, Heidelberg (2012)"},{"issue":"2","key":"12_CR8","doi-asserted-by":"publisher","first-page":"131","DOI":"10.7155\/jgaa.00064","volume":"7","author":"D. Eppstein","year":"2003","unstructured":"Eppstein, D.: Small maximal independent sets and faster exact graph coloring. J. Graph Algor. Appl.\u00a07(2), 131\u2013140 (2003)","journal-title":"J. Graph Algor. Appl."},{"issue":"2","key":"12_CR9","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/s00453-007-9152-0","volume":"52","author":"F.V. Fomin","year":"2008","unstructured":"Fomin, F.V., Gaspers, S., Pyatkin, A.V., Razgon, I.: On the minimum feedback vertex set problem: Exact and enumeration algorithms. Algorithmica\u00a052(2), 293\u2013307 (2008)","journal-title":"Algorithmica"},{"key":"12_CR10","doi-asserted-by":"crossref","unstructured":"Fomin, F.V., Grandoni, F., Pyatkin, A.V., Stepanov, A.A.: Combinatorial bounds via measure and conquer: Bounding minimal dominating sets and applications. ACM Trans.\u00a0Algorithms\u00a05(1) (2008)","DOI":"10.1145\/1435375.1435384"},{"key":"12_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/978-3-642-22300-6_34","volume-title":"Algorithms and Data Structures","author":"F.V. Fomin","year":"2011","unstructured":"Fomin, F.V., Heggernes, P., Kratsch, D., Papadopoulos, C., Villanger, Y.: Enumerating Minimal Subset Feedback Vertex Sets. In: Dehne, F., Iacono, J., Sack, J.-R. (eds.) WADS 2011. LNCS, vol.\u00a06844, pp. 399\u2013410. Springer, Heidelberg (2011)"},{"key":"12_CR12","doi-asserted-by":"crossref","unstructured":"Fomin, F.V., Kratsch, D.: Exact Exponential Algorithms. Springer, Texts in Theoretical Computer Science (2010)","DOI":"10.1007\/978-3-642-16533-7"},{"key":"12_CR13","unstructured":"Fomin, F.V., Villanger, Y.: Finding induced subgraphs via minimal triangulations. In: Proceedings STACS 2010, pp. 383\u2013394 (2010)"},{"key":"12_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/978-3-642-15775-2_23","volume-title":"Algorithms \u2013 ESA 2010","author":"S. Gaspers","year":"2010","unstructured":"Gaspers, S., Mnich, M.: On Feedback Vertex Sets in Tournaments. In: de Berg, M., Meyer, U. (eds.) ESA 2010. LNCS, vol.\u00a06346, pp. 267\u2013277. Springer, Heidelberg (2010)"},{"key":"12_CR15","doi-asserted-by":"crossref","unstructured":"Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs. Annals of Disc.\u00a0Math.\u00a057 (2004)","DOI":"10.1016\/S0167-5060(04)80051-7"},{"key":"12_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1007\/978-3-642-22953-4_26","volume-title":"Fundamentals of Computation Theory","author":"M.M. Kant\u00e9","year":"2011","unstructured":"Kant\u00e9, 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.\u00a06914, pp. 298\u2013309. Springer, Heidelberg (2011)"},{"key":"12_CR17","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1016\/0020-0190(76)90065-X","volume":"5","author":"E.L. Lawler","year":"1976","unstructured":"Lawler, E.L.: A note on the complexity of the chromatic number problem. Inform.\u00a0Proc.\u00a0Lett.\u00a05, 66\u201367 (1976)","journal-title":"Inform.\u00a0Proc.\u00a0Lett."},{"key":"12_CR18","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/s00453-003-1032-7","volume":"37","author":"R. McConnell","year":"2003","unstructured":"McConnell, R.: Linear-time recognition of circular-arc graphs. Algorithmica\u00a037, 93\u2013147 (2003)","journal-title":"Algorithmica"},{"key":"12_CR19","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/BF02760024","volume":"3","author":"J.W. Moon","year":"1965","unstructured":"Moon, J.W., Moser, L.: On cliques in graphs. Israel J. Math.\u00a03, 23\u201328 (1965)","journal-title":"Israel J. Math."},{"key":"12_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1007\/978-3-642-11409-0_26","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"Y. Okamoto","year":"2010","unstructured":"Okamoto, Y., Uehara, R., Uno, T.: Counting the Number of Matchings in Chordal and Chordal Bipartite Graph Classes. In: Paul, C., Habib, M. (eds.) WG 2009. LNCS, vol.\u00a05911, pp. 296\u2013307. Springer, Heidelberg (2010)"},{"key":"12_CR21","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/j.jda.2006.07.006","volume":"6","author":"Y. Okamoto","year":"2008","unstructured":"Okamoto, Y., Uno, T., Uehara, R.: Counting the number of independent sets in chordal graphs. J. Disc. Alg.\u00a06, 229\u2013242 (2008)","journal-title":"J. Disc. Alg."},{"key":"12_CR22","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1016\/S0166-218X(00)00339-5","volume":"117","author":"B. Schwikowski","year":"2002","unstructured":"Schwikowski, B., Speckenmeyer, E.: On enumerating all minimal solutions of feedback problems. Disc. Appl. Math.\u00a0117, 253\u2013265 (2002)","journal-title":"Disc. Appl. Math."},{"key":"12_CR23","doi-asserted-by":"crossref","unstructured":"Spinrad, J.P.: Efficient graph representations. AMS, Fields Institute Monograph Series 19 (2003)","DOI":"10.1090\/fim\/019"},{"key":"12_CR24","unstructured":"Weisstein, E.W.: Cograph. MathWorld, \n                  \n                    http:\/\/mathworld.wolfram.com\/Cograph.html"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-32241-9_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,6]],"date-time":"2019-05-06T21:50:17Z","timestamp":1557179417000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-32241-9_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642322402","9783642322419"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-32241-9_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}