The classification of coverings of processor networks
Journal of Parallel and Distributed Computing
Journal of Combinatorial Theory Series B
Fixed parameter complexity of λ-labelings
Discrete Applied Mathematics - special issue on the 25th international workshop on graph theoretic concepts in computer science (WG'99)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Partitioning graphs into generalized dominating sets
Nordic Journal of Computing
Generalized H-Coloring and H-Covering of Trees
WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
Local and global properties in networks of processors (Extended Abstract)
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Complexity of Partial Covers of Graphs
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
On the computational complexity of partial covers of Theta graphs
Discrete Applied Mathematics
Group-Level Analysis and Visualization of Social Networks
Algorithmics of Large and Complex Networks
Unifying two graph decompositions with modular decomposition
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Complexity of locally injective homomorphism to the theta graphs
IWOCA'10 Proceedings of the 21st international conference on Combinatorial algorithms
Locally injective homomorphism to the simple weight graphs
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
Structural similarity in graphs
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Survey: A survey of the algorithmic aspects of modular decomposition
Computer Science Review
| Hi-index | 0.00 |
A graph G is R-role assignable if there is a locally surjective homomorphism from G to R, i.e. a vertex mapping r: VG → VR, such that the neighborhood relation is preserved: r(NG(u)) = NR(r(u)). Kristiansen and Telle conjectured that the decision problem whether such a mapping exists is an NP-complete problem for any connected graph R on at least three vertices. In this paper we prove this conjecture, i.e. we give a complete complexity classification of the role assignment problem for connected graphs. We show further corollaries for disconnected graphs and related problems.