Parameterized complexity of the spanning tree congestion problem. Bodlaender, H. L., Fomin, F. V., Golovach, P. A., Otachi, Y., & van Leeuwen, E. J. Algorithmica, 64(1):85–111, 2012.
![Parameterized complexity of the spanning tree congestion problem [link]](https://bibbase.org/img/filetypes/link.svg "link")
Paper ![Parameterized complexity of the spanning tree congestion problem [pdf]](https://bibbase.org/img/filetypes/pdf.svg "pdf")
Paper doi bibtex
Paper Paper doi bibtex @article{2012l,
author = {Bodlaender, Hans L. and Fomin, Fedor V. and Golovach, Petr A. and Otachi, Yota and van Leeuwen, Erik Jan},
date-added = {2016-02-23 00:46:42 +0000},
date-modified = {2016-02-23 00:46:42 +0000},
doi = {10.1007/s00453-011-9565-7},
fjournal = {Algorithmica. An International Journal in Computer Science},
journal = {Algorithmica},
number = {1},
pages = {85--111},
title = {Parameterized complexity of the spanning tree congestion problem},
url = {http://dx.doi.org/10.1007/s00453-011-9565-7},
url_paper = {http://www.ii.uib.no/~fomin/articles/2012/2012l.pdf},
volume = {64},
year = {2012},
bdsk-url-1 = {http://dx.doi.org/10.1007/s00453-011-9565-7}}Downloads: 0
{"_id":"FX9BuNuxg93qLAWiF","bibbaseid":"bodlaender-fomin-golovach-otachi-vanleeuwen-parameterizedcomplexityofthespanningtreecongestionproblem-2012","downloads":0,"creationDate":"2016-02-23T00:49:16.385Z","title":"Parameterized complexity of the spanning tree congestion problem","author_short":["Bodlaender, H. L.","Fomin, F. V.","Golovach, P. A.","Otachi, Y.","van Leeuwen, E. J."],"year":2012,"bibtype":"article","biburl":"https://bibbase.org/network/files/NMvet57iG3cfoNh6G","bibdata":{"bibtype":"article","type":"article","author":[{"propositions":[],"lastnames":["Bodlaender"],"firstnames":["Hans","L."],"suffixes":[]},{"propositions":[],"lastnames":["Fomin"],"firstnames":["Fedor","V."],"suffixes":[]},{"propositions":[],"lastnames":["Golovach"],"firstnames":["Petr","A."],"suffixes":[]},{"propositions":[],"lastnames":["Otachi"],"firstnames":["Yota"],"suffixes":[]},{"propositions":["van"],"lastnames":["Leeuwen"],"firstnames":["Erik","Jan"],"suffixes":[]}],"date-added":"2016-02-23 00:46:42 +0000","date-modified":"2016-02-23 00:46:42 +0000","doi":"10.1007/s00453-011-9565-7","fjournal":"Algorithmica. An International Journal in Computer Science","journal":"Algorithmica","number":"1","pages":"85–111","title":"Parameterized complexity of the spanning tree congestion problem","url":"http://dx.doi.org/10.1007/s00453-011-9565-7","url_paper":"http://www.ii.uib.no/~fomin/articles/2012/2012l.pdf","volume":"64","year":"2012","bdsk-url-1":"http://dx.doi.org/10.1007/s00453-011-9565-7","bibtex":"@article{2012l,\n\tauthor = {Bodlaender, Hans L. and Fomin, Fedor V. and Golovach, Petr A. and Otachi, Yota and van Leeuwen, Erik Jan},\n\tdate-added = {2016-02-23 00:46:42 +0000},\n\tdate-modified = {2016-02-23 00:46:42 +0000},\n\tdoi = {10.1007/s00453-011-9565-7},\n\tfjournal = {Algorithmica. An International Journal in Computer Science},\n\tjournal = {Algorithmica},\n\tnumber = {1},\n\tpages = {85--111},\n\ttitle = {Parameterized complexity of the spanning tree congestion problem},\n\turl = {http://dx.doi.org/10.1007/s00453-011-9565-7},\n\turl_paper = {http://www.ii.uib.no/~fomin/articles/2012/2012l.pdf},\n\tvolume = {64},\n\tyear = {2012},\n\tbdsk-url-1 = {http://dx.doi.org/10.1007/s00453-011-9565-7}}\n\n","author_short":["Bodlaender, H. L.","Fomin, F. V.","Golovach, P. A.","Otachi, Y.","van Leeuwen, E. J."],"key":"2012l","id":"2012l","bibbaseid":"bodlaender-fomin-golovach-otachi-vanleeuwen-parameterizedcomplexityofthespanningtreecongestionproblem-2012","role":"author","urls":{"Paper":"http://dx.doi.org/10.1007/s00453-011-9565-7"," paper":"http://www.ii.uib.no/~fomin/articles/2012/2012l.pdf"},"metadata":{"authorlinks":{}},"downloads":0,"html":""},"search_terms":["parameterized","complexity","spanning","tree","congestion","problem","bodlaender","fomin","golovach","otachi","van leeuwen"],"keywords":[],"authorIDs":[],"dataSources":["C5FtkvWWggFfMJTFX","RtxX8siCrYJoMBHxn"]}