In this paper we show that graph isomorphism and chromatic index are solvable in polynomial time when restricted to the class of graphs with treewidth ≤ k ...
In this paper we show that Graph Isomorphism and Chromatic Index are solvable in polynomial time when restricted to the class of graphs with treewidth ≤k ...
Hence, it remains an open problem to find algorithms for CHROMATIC INDEX on partial k-trees with a better running time. The GRAPH ISOMORPHISM problem is a well- ...
Dec 18, 2014 · ... Their algorithm is based on the fact that a partial k-tree is decomposed into a collection of pairs of a k-vertex separator and a connected ...
Polynomial algorithms for Graph Isomorphism and Chromatic Index ...
link.springer.com › content › pdf
In this paper we show that GRAPH ISOMORPHISM and CHROMATIC INDEX are solvable in polynomial time when restricted to the class of graphs with treewidth < k ...
Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees · Contents. Journal of Algorithms. Volume 11, Issue 4 · PREVIOUS ARTICLE.
H.L. Bodlaender, polynomial algorithms for graph isomorphism and chromatic index on partial k-trees, J. Algorithms 11, pp. 631-643, 1990.
Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees. by Hans Bodlaender. 1990, Journal of Algorithms. See Full PDF
Nov 7, 2013 · H.L. Bodlander in Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees given a polynomial time algorithm for graph ...
The chromatic index of a partial k-tree can be determined in ... H. L. Bodlaender, Polynomial algorithms for graph isomorphism and chromatic index on.