The complexity of surjective homomorphism problems-a survey (Q444433): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The Complexity of Colouring by Semicomplete Digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Rooted Phylogeny Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dichotomy theorem for constraint satisfaction problems on a 3-element set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of conservative constraint satisfaction problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classifying the Complexity of Constraints Using Finite Algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of global cardinality constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of the List Partition Problem for Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(2K_{2}\) vertex-set partition into nonempty parts / rank
 
Normal rank
Property / cites work
 
Property / cites work: On generating all solutions of generalized satisfiability problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity Classifications of Boolean Constraint Satisfaction Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5365146 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding<i>H</i>-partitions efficiently / rank
 
Normal rank
Property / cites work
 
Property / cites work: List homomorphisms to reflexive graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: List homomorphisms and circular arc graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bi‐arc graphs and the complexity of list homomorphisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Retractions to Pseudoforests / rank
 
Normal rank
Property / cites work
 
Property / cites work: List Partitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory / 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: Covering graphs with few complete bipartite subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Vertex-Surjective Homomorphisms to Partially Reflexive Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4828516 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterizing Cut Sets in a Graph by the Number of Their Components / rank
 
Normal rank
Property / cites work
 
Property / cites work: On disconnected cuts and separators / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the algebraic structure of combinatorial problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Approximability of Three-valued MAX CSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring mixed hypertrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Structure of Polynomial Time Reducibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3221403 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Vertex-Surjective Graph Homomorphisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Undirected connectivity in log-space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tractable cases of the extended global cardinality constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of satisfiability problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The external constraint 4 nonempty part sandwich problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing role assignments of chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Complexity of Compaction to Reflexive Cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compaction, Retraction, and Constraint Satisfaction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational complexity of compaction to irreflexive cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: A complete and equal computational complexity classification of compaction and retraction to all graphs with at most four vertices and some general results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Partition of Some Class of Graphs under Compaction / rank
 
Normal rank

Latest revision as of 14:08, 5 July 2024

scientific article
Language Label Description Also known as
English
The complexity of surjective homomorphism problems-a survey
scientific article

    Statements

    The complexity of surjective homomorphism problems-a survey (English)
    0 references
    0 references
    0 references
    0 references
    14 August 2012
    0 references
    0 references
    surjective homomorphisms
    0 references
    computational complexity
    0 references
    constraint satisfaction
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references