A complete complexity classification of the role assignment problem

Theoretical Computer Science

Volumn 349, Issue 1, 2005, Pages 67-81

  Fiala, Jiří ^a   Paulusma, Daniël ^a,b  

^a CHARLES UNIVERSITY   (Czech Republic)

^b UNIVERSITY OF TWENTE   (Netherlands)

Author keywords

Computational complexity; Graph homomorphism; Role assignment

Indexed keywords

COMPUTATIONAL COMPLEXITY; GRAPH THEORY; PROBLEM SOLVING; SOCIAL ASPECTS; SOCIETIES AND INSTITUTIONS;

GRAPH HOMOMORPHISM; ROLE ASSIGNMENT; SOCIAL NETWORK THEORY;

CLASSIFICATION (OF INFORMATION);

EID: 27844474249     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2005.09.029     Document Type: Conference Paper

References (15)

1. J. Abello, M.R. Fellows, and J.C. Stillwell On the complexity and combinatorics of covering finite complexes Austral. J. Combin. 4 1991 103 112
2. D. Angluin Local and global properties in networks of processors Proc. 12th ACM Symp. on Theory of Computing 1980 82 93
3. D. Angluin, and A. Gardiner Finite common coverings of pairs of regular graphs J. Combin. Theory B 30 1981 184 187
4. N. Biggs Constructing 5-arc transitive cubic graphs J. London Math. Soc. II 26 1982 193 200
5. H.L. Bodlaender The classification of coverings of processor networks J. Parallel Distributed Comput. 6 1989 166 182
6. M.G. Everett, and S. Borgatti Role colouring a graph Math. Social Sci. 21 2 1991 183 188
7. J. Fiala, P. Heggernes, P. Kristiansen, J.A. Telle, Generalized H -coloring and H -covering of trees, in: Graph-Theoretic Concepts in Computer Science, 28th WG'02, Cesky Krumlov, Czech Republic, Lecture Notes in Computer Science, Vol. 2573, Springer, Berlin, 2002, pp. 198-210.
8. J. Fiala, J. Kratochvíl, Complexity of partial covers of graphs, in: Algorithms and Computation, 12th ISAAC '01, Christchurch, New Zealand, Lecture Notes in Computer Science, Vol. 2223, Springer, Berlin, 2001, pp. 537-549.
9. J. Fiala, and J. Kratochvíl Partial covers of graphs Discuss. Math. Graph Theory 22 2002 89 99
10. J. Fiala, J. Kratochvíl, and T. Kloks Fixed-parameter complexity of λ -labelings Discrete Appl. Math. 113 1 2001 59 72
11. M.R. Garey, and D.S. Johnson Computers and Intractability 1979 W. H. Freeman New York
12. P. Heggernes, and J.A. Telle Partitioning graphs into generalized dominating sets Nordic J. Comput. 5 2 1998 128 142
13. J. Kratochvíl, A. Proskurowski, and J.A. Telle Covering regular graphs J. Combin. Theory B 71 1 1997 1 16
14. P. Kristiansen, J.A. Telle, Generalized H -coloring of graphs, in: Algorithms and Computation, 11th ISAAC '01, Taipei, Taiwan, Lecture Notes in Computer Science, Vol. 1969, Springer, Berlin, 2000, pp. 456-466.
15. F.S. Roberts, and L. Sheng How hard is it to determine if a graph has a 2-role assignment? Networks 37 2 2001 67 73