Exact algorithms for treewidth and minimum fill-in. Fomin, F. V., Kratsch, D., Todinca, I., & Villanger, Y. SIAM J. Comput., 38(3):1058–1079, 2008.
Paper
Paper doi bibtex @article{2008b,
author = {Fomin, Fedor V. and Kratsch, Dieter and Todinca, Ioan and Villanger, Yngve},
date-added = {2016-02-23 00:46:10 +0000},
date-modified = {2016-04-08 23:13:28 +0000},
doi = {10.1137/050643350},
fjournal = {SIAM Journal on Computing},
issn = {0097-5397},
journal = {SIAM J. Comput.},
keywords = {treewidth, exact algorithm},
mrclass = {05C85 (68Q25 68R10 68W40)},
mrnumber = {2421078 (2009g:05166)},
mrreviewer = {Alexander Grigoriev},
number = {3},
pages = {1058--1079},
title = {Exact algorithms for treewidth and minimum fill-in},
url = {http://dx.doi.org/10.1137/050643350},
url_paper = {http://www.ii.uib.no/~fomin/articles/2008/2008b.pdf},
volume = {38},
year = {2008},
bdsk-url-1 = {http://dx.doi.org/10.1137/050643350}}
Downloads: 0
{"_id":"Gwkd4LXoR8FqhjsF3","bibbaseid":"fomin-kratsch-todinca-villanger-exactalgorithmsfortreewidthandminimumfillin-2008","downloads":0,"creationDate":"2015-06-23T17:42:39.989Z","title":"Exact algorithms for treewidth and minimum fill-in","author_short":["Fomin, F. V.","Kratsch, D.","Todinca, I.","Villanger, Y."],"year":2008,"bibtype":"article","biburl":"https://bibbase.org/network/files/NMvet57iG3cfoNh6G","bibdata":{"bibtype":"article","type":"article","author":[{"propositions":[],"lastnames":["Fomin"],"firstnames":["Fedor","V."],"suffixes":[]},{"propositions":[],"lastnames":["Kratsch"],"firstnames":["Dieter"],"suffixes":[]},{"propositions":[],"lastnames":["Todinca"],"firstnames":["Ioan"],"suffixes":[]},{"propositions":[],"lastnames":["Villanger"],"firstnames":["Yngve"],"suffixes":[]}],"date-added":"2016-02-23 00:46:10 +0000","date-modified":"2016-04-08 23:13:28 +0000","doi":"10.1137/050643350","fjournal":"SIAM Journal on Computing","issn":"0097-5397","journal":"SIAM J. Comput.","keywords":"treewidth, exact algorithm","mrclass":"05C85 (68Q25 68R10 68W40)","mrnumber":"2421078 (2009g:05166)","mrreviewer":"Alexander Grigoriev","number":"3","pages":"1058–1079","title":"Exact algorithms for treewidth and minimum fill-in","url":"http://dx.doi.org/10.1137/050643350","url_paper":"http://www.ii.uib.no/~fomin/articles/2008/2008b.pdf","volume":"38","year":"2008","bdsk-url-1":"http://dx.doi.org/10.1137/050643350","bibtex":"@article{2008b,\n\tauthor = {Fomin, Fedor V. and Kratsch, Dieter and Todinca, Ioan and Villanger, Yngve},\n\tdate-added = {2016-02-23 00:46:10 +0000},\n\tdate-modified = {2016-04-08 23:13:28 +0000},\n\tdoi = {10.1137/050643350},\n\tfjournal = {SIAM Journal on Computing},\n\tissn = {0097-5397},\n\tjournal = {SIAM J. Comput.},\n\tkeywords = {treewidth, exact algorithm},\n\tmrclass = {05C85 (68Q25 68R10 68W40)},\n\tmrnumber = {2421078 (2009g:05166)},\n\tmrreviewer = {Alexander Grigoriev},\n\tnumber = {3},\n\tpages = {1058--1079},\n\ttitle = {Exact algorithms for treewidth and minimum fill-in},\n\turl = {http://dx.doi.org/10.1137/050643350},\n\turl_paper = {http://www.ii.uib.no/~fomin/articles/2008/2008b.pdf},\n\tvolume = {38},\n\tyear = {2008},\n\tbdsk-url-1 = {http://dx.doi.org/10.1137/050643350}}\n\n","author_short":["Fomin, F. V.","Kratsch, D.","Todinca, I.","Villanger, Y."],"key":"2008b","id":"2008b","bibbaseid":"fomin-kratsch-todinca-villanger-exactalgorithmsfortreewidthandminimumfillin-2008","role":"author","urls":{"Paper":"http://dx.doi.org/10.1137/050643350"," paper":"http://www.ii.uib.no/~fomin/articles/2008/2008b.pdf"},"keyword":["treewidth","exact algorithm"],"metadata":{"authorlinks":{}},"downloads":0,"html":""},"search_terms":["exact","algorithms","treewidth","minimum","fill","fomin","kratsch","todinca","villanger"],"keywords":["treewidth","exact algorithm"],"authorIDs":[],"dataSources":["Cypug6AWS8rvGPR5j","RtxX8siCrYJoMBHxn"]}