The computational complexity of the role assignment problem
From MaRDI portal
Recommendations
- A complete complexity classification of the role assignment problem
- Computing Role Assignments of Chordal Graphs
- Computing role assignments of proper interval graphs in polynomial time
- Computing role assignments of chordal graphs
- Computing role assignments of proper interval graphs in polynomial time
Cited in
(14)- Role colouring graphs in hereditary classes
- On the computational complexity of partial covers of theta graphs
- Structural similarity: spectral methods for relaxed blockmodeling
- Computing role assignments of proper interval graphs in polynomial time
- Complexity of locally injective homomorphism to the Theta graphs
- Locally injective homomorphism to the simple weight graphs
- Computing Role Assignments of Chordal Graphs
- Group-Level Analysis and Visualization of Social Networks
- scientific article; zbMATH DE number 1302393 (Why is no real title available?)
- Computing role assignments of proper interval graphs in polynomial time
- A survey of the algorithmic aspects of modular decomposition
- Making Role Assignment Feasible: A Polynomial-Time Algorithm for Computing Ecological Colorings
- A complete complexity classification of the role assignment problem
- Mixed hypergraphs and other coloring problems
This page was built for publication: The computational complexity of the role assignment problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4449222)
