Related content

A partial k-arboretum of graphs with bounded treewidth

By Bodlaender H.L.  

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

Elsevier

Access to resources Recommend Favorite

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

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

Bounded model checking of infinite state systems

By Schuele Tobias   Schneider Klaus  

Formal Methods in System Design, Vol. 30, Iss. 1, 2007-02 ,pp. : 51-81

Springer Publishing Company

Access to resources Recommend Favorite

Infinite games on finitely coloured graphs with applications to automata on infinite trees

By Zielonka W.  

Theoretical Computer Science, Vol. 200, Iss. 1, 1998-06 ,pp. : 135-183

Elsevier

Access to resources Recommend Favorite