Author： Bläser Markus Hoffmann Christian
Publisher： Springer Publishing Company
ISSN： 0178-4617
Source： Algorithmica, Vol.61, Iss.1, 2011-09, pp. : 3-35
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Related content
A partial k-arboretum of graphs with bounded treewidth
Theoretical Computer Science, Vol. 209, Iss. 1, 1998-12 ,pp. :
Access to resources
Recommend
Compact Navigation and Distance Oracles for Graphs with Small Treewidth
Algorithmica, Vol. 69, Iss. 1, 2014-05 ,pp. :
On treewidth and minimum fill-in of asteroidal triple-free graphs
By Kloks T. Kratsch D. Spinrad J.
Theoretical Computer Science, Vol. 175, Iss. 2, 1997-04 ,pp. :
Linearly bounded infinite graphs
By Carayol Arnaud Meyer Antoine
Acta Informatica, Vol. 43, Iss. 4, 2006-11 ,pp. :
On testing for zero polynomials by a set of points with bounded precision
Theoretical Computer Science, Vol. 296, Iss. 1, 2003-03 ,pp. :