A partial k-arboretum of graphs with bounded treewidth

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.209, Iss.1, 1998-12, pp. : 1-45

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Fast Evaluation of Interlace Polynomials on Graphs of Bounded Treewidth

By Bläser Markus Hoffmann Christian

Algorithmica, Vol. 61, Iss. 1, 2011-09 ,pp. : 3-35

Springer Publishing Company

Access to resources Recommend Favorite

Compact Navigation and Distance Oracles for Graphs with Small Treewidth

By Farzan Arash Kamali Shahin

Algorithmica, Vol. 69, Iss. 1, 2014-05 ,pp. : 92-116

Springer Publishing Company

Access to resources Recommend Favorite

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. : 309-335

Elsevier

Access to resources Recommend Favorite

Linearly bounded infinite graphs

By Carayol Arnaud Meyer Antoine

Acta Informatica, Vol. 43, Iss. 4, 2006-11 ,pp. : 265-292

Springer Publishing Company

Access to resources Recommend Favorite

Sum Coloring of Bipartite Graphs with Bounded Degree

By Malafiejski Michal Giaro Krzysztof Janczewski Robert Kubale Marek

Algorithmica, Vol. 40, Iss. 4, 2004-09 ,pp. : 235-244

Springer Publishing Company

Access to resources Recommend Favorite