Pages that link to "Item:Q817773"

The following pages link to A complete complexity classification of the role assignment problem (Q817773):

Displaying 36 items.

• Computing role assignments of split graphs (Q287443) (← links)
• Tree-representation of set families and applications to combinatorial decompositions (Q412262) (← links)
• The complexity of surjective homomorphism problems-a survey (Q444433) (← links)
• Computing role assignments of proper interval graphs in polynomial time (Q450561) (← links)
• Locally constrained graph homomorphisms -- structure, complexity, and applications (Q458463) (← links)
• On the power of synchronization between two adjacent processes (Q660989) (← links)
• Computing role assignments of chordal graphs (Q708211) (← links)
• Computing vertex-surjective homomorphisms to partially reflexive trees (Q714844) (← links)
• Finding vertex-surjective graph homomorphisms (Q715053) (← links)
• Parameterizing role coloring on forests (Q831825) (← links)
• On the complexity of role colouring planar graphs, trees and cographs (Q891815) (← links)
• Comparing universal covers in polynomial time (Q987372) (← links)
• Surjective \(H\)-colouring: new hardness results (Q2011662) (← links)
• Role colouring graphs in hereditary classes (Q2034782) (← links)
• Role coloring bipartite graphs (Q2081494) (← links)
• List covering of regular multigraphs (Q2169958) (← links)
• Subexponential algorithms for variants of the homomorphism problem in string graphs (Q2301363) (← links)
• Locally constrained homomorphisms on graphs of bounded treewidth and bounded degree (Q2348037) (← links)
• Locally constrained graph homomorphisms and equitable partitions (Q2427537) (← links)
• Packing bipartite graphs with covers of complete bipartite graphs (Q2442206) (← links)
• Exact algorithm for graph homomorphism and locally injective graph homomorphism (Q2446599) (← links)
• How hard is it to determine if a graph has a 2-role assignment? (Q2714905) (← links)
• Computing Role Assignments of Proper Interval Graphs in Polynomial Time (Q3000505) (← links)
• Computing Vertex-Surjective Homomorphisms to Partially Reflexive Trees (Q3007632) (← links)
• Graph labelings derived from models in distributed computing: A complete complexity classification (Q3100700) (← links)
• Comparing Universal Covers in Polynomial Time (Q3503635) (← links)
• Computational Complexity of Generalized Domination: A Complete Dichotomy for Chordal Graphs (Q3508549) (← links)
• Labelled (Hyper)Graphs, Negotiations and the Naming Problem (Q3540388) (← links)
• The Complexity of Boolean Surjective General-Valued CSPs (Q5111218) (← links)
• Making Role Assignment Feasible: A Polynomial-Time Algorithm for Computing Ecological Colorings (Q5302046) (← links)
• A Representation Theorem for Union-Difference Families and Application (Q5458554) (← links)
• (Q5874546) (← links)
• Computing role assignments of Cartesian product of graphs (Q6050574) (← links)
• List covering of regular multigraphs with semi-edges (Q6119831) (← links)
• \(\boldsymbol{(\alpha, \beta )}\)-Modules in Graphs (Q6188517) (← links)
• An algorithmic framework for locally constrained homomorphisms (Q6499010) (← links)