Pages that link to "Item:Q817773"
From MaRDI portal
The following pages link to A complete complexity classification of the role assignment problem (Q817773):
Displayed 6 items.
- Locally constrained graph homomorphisms and equitable partitions (Q2427537) (← 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)
- 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)