{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T13:45:50Z","timestamp":1787319950816,"version":"build-2736575974"},"reference-count":9,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Discrete Math."],"published-print":{"date-parts":[[2018,1]]},"abstract":"<jats:p>Kant\u00e9 and Nourine [ SIAM J. Discrete Math., 30 (2016), pp. 311--326] present a polynomial time algorithm for the computation of the hull number of chordal graphs. We point out a gap in the correctness proof of their algorithm for chordal graphs and show that computing the hull number of a chordal graph is NP-hard, which most likely rules out the existence of a polynomial time algorithm.<\/jats:p>","DOI":"10.1137\/17m1131726","type":"journal-article","created":{"date-parts":[[2018,2,22]],"date-time":"2018-02-22T13:09:36Z","timestamp":1519304976000},"page":"543-547","source":"Crossref","is-referenced-by-count":11,"title":["The Geodetic Hull Number is Hard for Chordal Graphs"],"prefix":"10.1137","volume":"32","author":[{"given":"St\u00e9phane","family":"Bessy","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mitre C.","family":"Dourado","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lucia D.","family":"Penso","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dieter","family":"Rautenbach","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2018,2,22]]},"reference":[{"key":"atypb1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-54423-1_37"},{"key":"atypb2","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2012.12.035"},{"key":"atypb3","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2015.03.019"},{"key":"atypb4","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2008.04.020"},{"key":"atypb5","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2016.05.047"},{"key":"atypb6","doi-asserted-by":"publisher","DOI":"10.1137\/090751797"},{"key":"atypb7","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(85)90174-8"},{"key":"atypb8","unstructured":"M. R. Garey and D. S. Johnson,\n                      Computers and Intractability: A Guide to the Theory of NP-Completeness\n                      , W. H. Freeman, New York, 1979."},{"key":"atypb9","doi-asserted-by":"publisher","DOI":"10.1137\/15M1013389"}],"container-title":["SIAM Journal on Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/17M1131726","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T12:54:08Z","timestamp":1787316848000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/17M1131726"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,1]]},"references-count":9,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,1]]}},"alternative-id":["10.1137\/17M1131726"],"URL":"https:\/\/doi.org\/10.1137\/17m1131726","relation":{},"ISSN":["0895-4801","1095-7146"],"issn-type":[{"value":"0895-4801","type":"print"},{"value":"1095-7146","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,1]]}}}