{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:24:32Z","timestamp":1759638272430},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642358425"},{"type":"electronic","value":"9783642358432"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-35843-2_24","type":"book-chapter","created":{"date-parts":[[2013,1,11]],"date-time":"2013-01-11T02:24:54Z","timestamp":1357871094000},"page":"268-279","source":"Crossref","is-referenced-by-count":6,"title":["Polynomial Time Algorithms for Computing a Minimum Hull Set in Distance-Hereditary and Chordal Graphs"],"prefix":"10.1007","author":[{"given":"Mamadou Moustapha","family":"Kant\u00e9","sequence":"first","affiliation":[]},{"given":"Lhouari","family":"Nourine","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"24_CR1","doi-asserted-by":"crossref","unstructured":"Ara\u00fajo, J., Campos, V., Giroire, F., Nisse, N., Sampaio L., Soares, R.P.: On the hull number of some graph classes. Technical report (2011)","DOI":"10.1016\/j.endm.2011.09.009"},{"issue":"2","key":"24_CR2","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1002\/jgt.3190120210","volume":"12","author":"A. Bouchet","year":"1988","unstructured":"Bouchet, A.: Transforming trees by successive local complementations. J. Graph Theory\u00a012(2), 195\u2013207 (1988)","journal-title":"J. Graph Theory"},{"key":"24_CR3","doi-asserted-by":"publisher","first-page":"2265","DOI":"10.1155\/S0161171203210577","volume":"36","author":"G. Chartrand","year":"2003","unstructured":"Chartrand, G., Fink, J.F., Zhang, P.: The hull number of an oriented graph. International Journal of Mathematics and Mathematical Sciences\u00a0(36), 2265\u20132275 (2003)","journal-title":"International Journal of Mathematics and Mathematical Sciences"},{"key":"24_CR4","doi-asserted-by":"crossref","unstructured":"Chv\u00e1tal, V.: Antimatroids, betweenness, convexity. In: Cook, W.J., Lov\u00e1sz, L. (eds.) Research Trends in Combinatorial Optimization, pp. 57\u201364. Springer (2009)","DOI":"10.1007\/978-3-540-76796-1_3"},{"key":"24_CR5","first-page":"33","volume-title":"Data Base Systems","author":"E.F. Codd","year":"1972","unstructured":"Codd, E.F.: Further normalization of the data base relational model. In: Rustin, R. (ed.) Data Base Systems, pp. 33\u201364. Prentice Hall, Englewood Cliffs (1972)"},{"key":"24_CR6","doi-asserted-by":"crossref","unstructured":"Courcelle, B.: The monadic second-order logic of graphs XVI: Canonical graph decompositions. Logical Methods in Computer Science\u00a02(2) (2006)","DOI":"10.2168\/LMCS-2(2:2)2006"},{"key":"24_CR7","doi-asserted-by":"crossref","unstructured":"Courcelle, B., Engelfriet, J.: Graph Structure and Monadic Second-Order Logic: a Language Theoretic Approach. Encyclopedia of Mathematics and its Applications, vol.\u00a0138. Cambridge University Press (2012)","DOI":"10.1017\/CBO9780511977619"},{"key":"24_CR8","doi-asserted-by":"publisher","first-page":"734","DOI":"10.4153\/CJM-1980-057-7","volume":"32","author":"W.H. Cunningham","year":"1980","unstructured":"Cunningham, W.H., Edmonds, J.: A combinatorial decomposition theory. Canadian Journal of Mathematics\u00a032, 734\u2013765 (1980)","journal-title":"Canadian Journal of Mathematics"},{"issue":"2","key":"24_CR9","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1006\/jagm.2000.1090","volume":"36","author":"E. Dahlhaus","year":"2000","unstructured":"Dahlhaus, E.: Parallel algorithms for hierarchical clustering and applications to split decomposition and parity graph recognition. J. Algorithms\u00a036(2), 205\u2013240 (2000)","journal-title":"J. Algorithms"},{"key":"24_CR10","doi-asserted-by":"crossref","unstructured":"Diestel, R.: Graph Theory, 3rd edn. Springer (2005)","DOI":"10.1007\/978-3-642-14279-6_7"},{"issue":"1-2","key":"24_CR11","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/BF02992776","volume":"25","author":"G.A. Dirac","year":"1961","unstructured":"Dirac, G.A.: On rigid circuit graphs. Abhandlungen Aus Dem Mathematischen Seminare der Universit\u00e4t Hamburg\u00a025(1-2), 71\u201376 (1961)","journal-title":"Abhandlungen Aus Dem Mathematischen Seminare der Universit\u00e4t Hamburg"},{"issue":"18","key":"24_CR12","doi-asserted-by":"publisher","first-page":"5668","DOI":"10.1016\/j.disc.2008.04.020","volume":"309","author":"M.C. Dourado","year":"2009","unstructured":"Dourado, M.C., Gimbel, J.G., Kratochv\u00edl, J., Protti, F., Szwarcfiter, J.L.: On the computation of the hull number of a graph. Discrete Mathematics\u00a0309(18), 5668\u20135674 (2009)","journal-title":"Discrete Mathematics"},{"issue":"4","key":"24_CR13","doi-asserted-by":"publisher","first-page":"2163","DOI":"10.1137\/090751797","volume":"23","author":"M.C. Dourado","year":"2010","unstructured":"Dourado, M.C., Protti, F., Rautenbach, D., Szwarcfiter, J.L.: On the hull number of triangle-free graphs. SIAM J. Discrete Math.\u00a023(4), 2163\u20132172 (2010)","journal-title":"SIAM J. Discrete Math."},{"issue":"4","key":"24_CR14","doi-asserted-by":"publisher","first-page":"832","DOI":"10.1016\/j.disc.2009.09.018","volume":"310","author":"M.C. Dourado","year":"2010","unstructured":"Dourado, M.C., Protti, F., Rautenbach, D., Szwarcfiter, J.L.: Some remarks on the geodetic number of a graph. Discrete Mathematics\u00a0310(4), 832\u2013837 (2010)","journal-title":"Discrete Mathematics"},{"key":"24_CR15","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.\u00a07256, pp. 279\u2013290. Springer, Heidelberg (2012)"},{"issue":"3","key":"24_CR16","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/0012-365X(85)90174-8","volume":"57","author":"M.G. Everett","year":"1985","unstructured":"Everett, M.G., Seidman, S.B.: The hull number of a graph. Discrete Mathematics\u00a057(3), 217\u2013223 (1985)","journal-title":"Discrete Mathematics"},{"issue":"3","key":"24_CR17","doi-asserted-by":"publisher","first-page":"835","DOI":"10.2140\/pjm.1965.15.835","volume":"15","author":"D.R. Fulkerson","year":"1965","unstructured":"Fulkerson, D.R., Gross, O.A.: Incidence Matrices and Interval Graphs. Pacific J. Math.\u00a015(3), 835\u2013855 (1965)","journal-title":"Pacific J. Math."},{"issue":"1-3","key":"24_CR18","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/S0012-365X(03)00232-2","volume":"273","author":"C. Gavoille","year":"2003","unstructured":"Gavoille, C., Paul, C.: Distance labeling scheme and split decomposition. Discrete Mathematics\u00a0273(1-3), 115\u2013130 (2003)","journal-title":"Discrete Mathematics"},{"issue":"3","key":"24_CR19","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1142\/S0129054100000260","volume":"11","author":"M.C. Golumbic","year":"2000","unstructured":"Golumbic, M.C., Rotics, U.: On the clique-width of some perfect graph classes. Int. J. Found. Comput. Sci.\u00a011(3), 423\u2013443 (2000)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"24_CR20","unstructured":"Pelayo, I.M.: On convexity in graphs. Technical report (2004)"},{"issue":"2","key":"24_CR21","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1137\/0205021","volume":"5","author":"D.J. Rose","year":"1976","unstructured":"Rose, D.J., Tarjan, R.E., Lueker, G.S.: Algorithmic aspects of vertex elimination on graphs. SIAM J. Comput.\u00a05(2), 266\u2013283 (1976)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"24_CR22","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1093\/comjnl\/39.2.124","volume":"39","author":"H. Saiedian","year":"1996","unstructured":"Saiedian, H., Spencer, T.: An efficient algorithm to compute the candidate keys of a relational database schema. Comput. J.\u00a039(2), 124\u2013132 (1996)","journal-title":"Comput. J."}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2013: Theory and Practice of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-35843-2_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,8]],"date-time":"2019-07-08T05:28:22Z","timestamp":1562563702000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-35843-2_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642358425","9783642358432"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-35843-2_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}