An algorithmic framework for locally constrained homomorphisms (Q6039418): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W4313005607 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4017175 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite common coverings of pairs of regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic Graph Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing 5-Arc-Transitive Cubic Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locally Injective Homomorphism to the Simple Weight Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational complexity of covering disconnected multigraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: SOFSEM 2005: Theory and Practice of Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3416074 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph labelings derived from models in distributed computing: A complete complexity classification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing bipartite graphs with covers of complete bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locally constrained homomorphisms on graphs of bounded treewidth and bounded degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conjunctive query containment revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing role assignments of split graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-parameter tractability and completeness II: On completeness for W[1] / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computational complexity of vertex integrity and component order connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity landscape of decompositional parameters for ILP: programs with few global variables and constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Role colouring a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Layout Problems Parameterized by Vertex Cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-parameter complexity of \(\lambda\)-labelings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial covers of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locally constrained graph homomorphisms -- structure, complexity, and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computational complexity of partial covers of theta graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A complete complexity classification of the role assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparing universal covers in polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dichotomy of the H-Quasi-Cover Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An application of simultaneous diophantine approximation in combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of homomorphism and constraint satisfaction problems seen from the other side / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing role assignments of proper interval graphs in polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of H-coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4828516 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing role assignments of chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minkowski's Convex Body Theorem and Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regular codes in regular graphs are difficult / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4223772 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational complexity of covering three-vertex multigraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4472519 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Backdoors to planning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Programming with a Fixed Number of Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Locally Injective Homomorphism to the Theta Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5534009 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Homomorphisms of derivative graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparsity. Graphs, structures, and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subexponential algorithms for variants of the homomorphism problem in string graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterizing role coloring on forests / rank
 
Normal rank
Property / cites work
 
Property / cites work: The role assignment model nearly fits most social networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of role colouring planar graphs, trees and cographs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Role colouring graphs in hereditary classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: How hard is it to determine if a graph has a 2-role assignment? / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 01:33, 1 August 2024

scientific article; zbMATH DE number 7682405
Language Label Description Also known as
English
An algorithmic framework for locally constrained homomorphisms
scientific article; zbMATH DE number 7682405

    Statements

    An algorithmic framework for locally constrained homomorphisms (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    5 May 2023
    0 references
    (locally constrained) graph homomorphism
    0 references
    parameterized complexity
    0 references
    fracture number
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers