Efficient algorithms for combinatorial problems on graphs with bounded, decomposability—a survey
BIT - Ellis Horwood series in artificial intelligence
The complexity of colouring problems on dense graphs
Theoretical Computer Science
Complexity of finding embeddings in a k-tree
SIAM Journal on Algebraic and Discrete Methods
On the complexity of H-coloring
Journal of Combinatorial Theory Series B
Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees
Journal of Algorithms
Easy problems for tree-decomposable graphs
Journal of Algorithms
Algorithms finding tree-decompositions of graphs
Journal of Algorithms
Finding approximate separators and computing tree width quickly
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Discrete Mathematics - Algebraic graph theory; a volume dedicated to Gert Sabidussi
Efficient parallel algorithms for graphs of bounded tree-width
Journal of Algorithms
A very simple algorithm for estimating the number of k-colorings of a low-degree graph
Random Structures & Algorithms
Efficient and constructive algorithms for the pathwidth and treewidth of graphs
Journal of Algorithms
A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
SIAM Journal on Computing
The expression of graph properties and graph transformations in monadic second-order logic
Handbook of graph grammars and computing by graph transformation
List homomorphisms to reflexive graphs
Journal of Combinatorial Theory Series B
An algorithm for the Tutte polynomials of graphs of bounded treewidth
Discrete Mathematics
On Approximately Counting Colorings of Small Degree Graphs
SIAM Journal on Computing
The complexity of counting graph homomorphisms (extended abstract)
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Graph homomorphisms and phase transitions
Journal of Combinatorial Theory Series B
The complexity of H-colouring of bounded degree graphs
Discrete Mathematics
Discrete Applied Mathematics - Special issue on international workshop of graph-theoretic concepts in computer science WG'98 conference selected papers
On Markov chains for randomly H-coloring a graph
Journal of Algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Algorithms for Vertex Partitioning Problems on Partial k-Trees
SIAM Journal on Discrete Mathematics
Treewidth: Algorithmoc Techniques and Results
MFCS '97 Proceedings of the 22nd International Symposium on Mathematical Foundations of Computer Science
On Counting Independent Sets in Sparse Graphs
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Counting models for 2SAT and 3SAT formulae
Theoretical Computer Science
Towards a dichotomy theorem for the counting constraint satisfaction problem
Information and Computation
Counting Subgraphs via Homomorphisms
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Exact algorithms for graph homomorphisms
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Faster algorithms for finding and counting subgraphs
Journal of Computer and System Sciences
Fixed-Parameter tractability of treewidth and pathwidth
The Multivariate Algorithmic Revolution and Beyond
The complexity of approximating bounded-degree Boolean #CSP
Information and Computation
The complexity of the counting constraint satisfaction problem
Journal of the ACM (JACM)
| Hi-index | 5.24 |
The problem of counting all H-colorings of a graph G with n vertices is considered. While the problem is, in general, #P-complete, we give linear time algorithms that solve the main variants of this problem when the input graph G is a k-tree or, in the case where G is directed, when the underlying graph of G is a k-tree. Our algorithms remain polynomial even in the case where k=O(logn) or in the case where the size of H is O(n). Our results are easy to implement and imply the existence of polynomial time algorithms for a series of problems on partial k-trees such as core checking and chromatic polynomial computation.