An algorithmic framework for locally constrained homomorphisms

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Cites Work

Fundamentals of parameterized complexity
Title not available (Why is that?)
The complexity of homomorphism and constraint satisfaction problems seen from the other side
Title not available (Why is that?)
Paths, Trees, and Flowers
On the complexity of H-coloring
Parametrized complexity theory.
Integer Programming with a Fixed Number of Variables
Minkowski's Convex Body Theorem and Integer Programming
Title not available (Why is that?)
On the completeness of a generalized matching problem
Parameterized Algorithms
Title not available (Why is that?)
Title not available (Why is that?)
The core of a graph
Improved upper bounds for vertex cover
Algorithms for Vertex Partitioning Problems on Partial k-Trees
Role colouring a graph
Locally constrained homomorphisms on graphs of bounded treewidth and bounded degree
How hard is it to determine if a graph has a 2-role assignment?
Computing role assignments of split graphs
Local computations in graphs: the case of cellular edge local computations
Title not available (Why is that?)
Computing role assignments of proper interval graphs in polynomial time
The role assignment model nearly fits most social networks
Computing role assignments of chordal graphs
A complete complexity classification of the role assignment problem
Comparing universal covers in polynomial time
Fixed-parameter tractability and completeness II: On completeness for W[1]
An application of simultaneous diophantine approximation in combinatorial optimization
Fixed-Parameter Tractable Canonization and Isomorphism Test for Graphs of Bounded Treewidth
Graph Layout Problems Parameterized by Vertex Cover
Locally constrained graph homomorphisms -- structure, complexity, and applications
Homomorphisms of derivative graphs
Safe set problem on graphs
Title not available (Why is that?)
Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree
Fixed-parameter complexity of \(\lambda\)-labelings
Conjunctive query containment revisited
Algorithms for vertex-partitioning problems on graphs with fixed clique-width.
Fast dynamic programming for locally checkable vertex subset and vertex partitioning problems
Title not available (Why is that?)
Regular codes in regular graphs are difficult
Covering regular graphs
Title not available (Why is that?)
Partial covers of graphs
Finite common coverings of pairs of regular graphs
On the computational complexity of partial covers of theta graphs
Constructing 5-Arc-Transitive Cubic Graphs
SOFSEM 2005: Theory and Practice of Computer Science
Packing bipartite graphs with covers of complete bipartite graphs
Complexity of locally injective homomorphism to the Theta graphs
Role coloring bipartite graphs
Parameterizing role coloring on forests
On the complexity of role colouring planar graphs, trees and cographs
Computational complexity of covering three-vertex multigraphs
Graph labelings derived from models in distributed computing: A complete complexity classification
Safe number and integrity of graphs
Backdoors to planning
Role colouring graphs in hereditary classes
Subexponential algorithms for variants of the homomorphism problem in string graphs
Computational complexity of covering disconnected multigraphs
List covering of regular multigraphs
Title not available (Why is that?)
Locally injective homomorphism to the simple weight graphs
Dichotomy of the \(H\)-quasi-cover problem
An algorithmic framework for locally constrained homomorphisms

This page was built for publication: An algorithmic framework for locally constrained homomorphisms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6499010)