{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T18:03:43Z","timestamp":1710266623665},"reference-count":14,"publisher":"World Scientific Pub Co Pte Lt","issue":"01","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2009,2]]},"abstract":"<jats:p> We prove # P -completeness for counting the number of forests in regular graphs and chordal graphs. We also present algorithms for this problem, running in O *(1.8494<jats:sup>m<\/jats:sup>) time for 3-regular graphs, and O *(1.9706<jats:sup>m<\/jats:sup>) time for unit interval graphs, where m is the number of edges in the graph and O *-notation ignores a polynomial factor. The algorithms can be generalized to the Tutte polynomial computation. <\/jats:p>","DOI":"10.1142\/s0129054109006437","type":"journal-article","created":{"date-parts":[[2009,2,17]],"date-time":"2009-02-17T10:16:23Z","timestamp":1234865783000},"page":"25-44","source":"Crossref","is-referenced-by-count":2,"title":["FAST EXPONENTIAL-TIME ALGORITHMS FOR THE FOREST COUNTING AND THE TUTTE POLYNOMIAL COMPUTATION IN GRAPH CLASSES"],"prefix":"10.1142","volume":"20","author":[{"given":"HEIDI","family":"GEBAUER","sequence":"first","affiliation":[{"name":"Institute of Theoretical Computer Science, ETH Zurich, Zurich, CH-8092, Switzerland"}]},{"given":"YOSHIO","family":"OKAMOTO","sequence":"additional","affiliation":[{"name":"Department of Information and Computer Sciences, Toyohashi University of Technology, Hibarigaoka 1-1, Tempaku, Toyohashi, Aichi, 441-8580, Japan"}]}],"member":"219","published-online":{"date-parts":[[2012,4,30]]},"reference":[{"key":"rf1","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(98)00113-7"},{"key":"rf2","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548300001188"},{"key":"rf3","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey M.","year":"1979"},{"key":"rf4","doi-asserted-by":"publisher","DOI":"10.1137\/050645208"},{"key":"rf5","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(95)00133-W"},{"key":"rf6","doi-asserted-by":"publisher","DOI":"10.1017\/S0305004100068936"},{"key":"rf7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-0348-8005-3"},{"key":"rf8","first-page":"497","volume":"72","author":"Kirchhoff G.","journal-title":"Annalen Physik Chemie"},{"key":"rf9","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548398003551"},{"key":"rf11","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539797321602"},{"key":"rf13","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548300000195"},{"key":"rf14","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511752506"},{"key":"rf15","volume-title":"Introduction to Graph Theory","author":"West D.","year":"2001"},{"key":"rf16","volume-title":"Algorithms and Complexity","author":"Wilf H.","year":"1986"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054109006437","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T12:39:20Z","timestamp":1565095160000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054109006437"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,2]]},"references-count":14,"journal-issue":{"issue":"01","published-online":{"date-parts":[[2012,4,30]]},"published-print":{"date-parts":[[2009,2]]}},"alternative-id":["10.1142\/S0129054109006437"],"URL":"https:\/\/doi.org\/10.1142\/s0129054109006437","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,2]]}}}