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
Local Computations in Graphs: The Case of Cellular Edge Local Computations
Fundamenta Informaticae - SPECIAL ISSUE ON ICGT 2004
Locally constrained graph homomorphisms and equitable partitions
European Journal of Combinatorics
Labelled (Hyper)Graphs, Negotiations and the Naming Problem
ICGT '08 Proceedings of the 4th international conference on Graph Transformations
Making Role Assignment Feasible: A Polynomial-Time Algorithm for Computing Ecological Colorings
Graph-Theoretic Concepts in Computer Science
Computational complexity of generalized domination: a complete dichotomy for chordal graphs
WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science
Computing role assignments of chordal graphs
FCT'09 Proceedings of the 17th international conference on Fundamentals of computation theory
A representation theorem for union-difference families and application
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Comparing universal covers in polynomial time
CSR'08 Proceedings of the 3rd international conference on Computer science: theory and applications
Computing role assignments of chordal graphs
Theoretical Computer Science
Computing role assignments of proper interval graphs in polynomial time
IWOCA'10 Proceedings of the 21st international conference on Combinatorial algorithms
Computing vertex-surjective homomorphisms to partially reflexive trees
CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
Locally injective graph homomorphism: lists guarantee dichotomy
WG'06 Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science
Matrix and graph orders derived from locally constrained graph homomorphisms
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Tree-representation of set families and applications to combinatorial decompositions
European Journal of Combinatorics
Packing bipartite graphs with covers of complete bipartite graphs
CIAC'10 Proceedings of the 7th international conference on Algorithms and Complexity
Computing role assignments of proper interval graphs in polynomial time
Journal of Discrete Algorithms
The complexity of surjective homomorphism problems-a survey
Discrete Applied Mathematics
Locally constrained graph homomorphisms-structure, complexity, and applications
Computer Science Review
Computing vertex-surjective homomorphisms to partially reflexive trees
Theoretical Computer Science
Local Computations in Graphs: The Case of Cellular Edge Local Computations
Fundamenta Informaticae - SPECIAL ISSUE ON ICGT 2004
Locally constrained homomorphisms on graphs of bounded treewidth and bounded degree
FCT'13 Proceedings of the 19th international conference on Fundamentals of Computation Theory
Packing bipartite graphs with covers of complete bipartite graphs
Discrete Applied Mathematics
Exact algorithm for graph homomorphism and locally injective graph homomorphism
Information Processing Letters
Hi-index | 0.00 |
In social network theory a society is often represented by a simple graph G, where vertices stand for individuals and edges represent relationships between those individuals. The description of the social network is tried to be simplified by assigning roles to the individuals, such that the neighborhood relation is preserved. Formally, for a fixed graph R we ask for a vertex mapping r: VG → VR, such that r(NG(u)) = NR(r(u)) for all u ∈ VG.If such a mapping exists the graph G is called R-role assignable and the corresponding decision problem is called the R-role assignment problem. Kristiansen and Telle conjectured that the R-role assignment problem is an NP-complete problem for any simple connected graph R on at least three vertices. In this paper we prove their conjecture. In addition, we determine the computational complexity of the role assignment problem for nonsimple and disconnected role graphs, as these are considered in social network theory as well.