A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth

@article{citeulike:2588807, author = {Bodlaender, Hans L. }, citeulike-article-id = {2588807}, journal = {SIAM Journal on Computing}, keywords = {algorithms, graph, topology}, number = {6}, pages = {1305--1317}, posted-at = {2008-03-26 09:10:35}, priority = {2}, publisher = {SIAM}, title = {A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth}, url = {http://scitation.aip.org/getabs/servlet/GetabsServlet?prog=normal\&id=SMJCAT000025000006001305000001\&idtype=cvips\&gifs=yes}, volume = {25}, year = {1996} }

TY - JOUR ID - citeulike:2588807 L3 - citeulike-article-id:2588807 TI - A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth JF - SIAM Journal on Computing VL - 25 IS - 6 SP - 1305 EP - 1317 PB - SIAM KW - algorithms KW - graph KW - topology AU - Bodlaender, Hans PY - 1996/// UR - http://scitation.aip.org/getabs/servlet/GetabsServlet?prog=normal&id=SMJCAT000025000006001305000001&idtype=cvips&gifs=yes ER -