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