The following pages link to (Q2714905):
Displayed 9 items.
- Computing role assignments of chordal graphs (Q708211) (← links)
- A complete complexity classification of the role assignment problem (Q817773) (← links)
- Comparing universal covers in polynomial time (Q987372) (← links)
- 2-role assignments on triangulated graphs. (Q1401397) (← links)
- Graph coloring, minimum-diameter partitioning, and the analysis of confusion matrices (Q1775813) (← links)
- Locally constrained graph homomorphisms and equitable partitions (Q2427537) (← links)
- Comparing Universal Covers in Polynomial Time (Q3503635) (← links)
- Making Role Assignment Feasible: A Polynomial-Time Algorithm for Computing Ecological Colorings (Q5302046) (← links)
- The role assignment model nearly fits most social networks (Q5939411) (← links)