The computational complexity of the role assignment problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2719, Issue , 2003, Pages 817-828

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

^a CHARLES UNIVERSITY   (Czech Republic)

^b UNIVERSITY OF TWENTE   (Netherlands)

Author keywords

Computational complexity; Graph homomorphism; Role assignment

Indexed keywords

COMBINATORIAL OPTIMIZATION; COMPUTATIONAL COMPLEXITY; MAPPING;

CONNECTED GRAPH; DECISION PROBLEMS; DISCONNECTED GRAPH; GRAPH HOMOMORPHISMS; LOCALLY SURJECTIVE HOMOMORPHISMS; NEIGHBORHOOD RELATION; ROLE ASSIGNMENT; ROLE ASSIGNMENT PROBLEMS;

GRAPH THEORY;

EID: 35248836862     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45061-0_64     Document Type: Article

References (15)

1. ABELLO, J., FELLOWS, M. R., AND STILLWELL, J. C. On the complexity and combinatorics of covering finite complexes. Australian Journal of Combinatorics 4 (1991), 103-112.
2. ANGLUIN, D. Local and global properties in networks of processors. In Proceedings of the 12th ACM Symposium on Theory of Computing (1980), 82-93.
3. ANGLUIN, D., AND GARDINER, A. Finite common coverings of pairs of regular graphs. Journal of Combinatorial Theory B 30 (1981), 184-187.
4. BIGGS, N. Constructing 5-arc transitive cubic graphs. Journal of London Mathematical Society II. 26 (1982), 193-200.
5. BODLAENDER, H. L. The classification of coverings of processor networks. Journal of Parallel Distributed Computing 6 (1989), 166-182.
6. EVERETT, M. G., AND BORGATTI, S. Role coloring a graph. Mathematical Social Sciences 21, 2 (1991), 183-188.
7. FIALA, J., HEGGERNES, P., KRISTIANSEN, P., AND TELLE, J. A. Generalized H-coloring and H-covering of trees. In Graph-Theoretical Concepts in Computer Science, 28th WG '02, Český Krumlov (2002), no. 2573 in Lecture Notes in Computer Science, Springer Verlag, pp. 198-210.
8. FIALA, J., AND KRATOCHVÍL, J. Complexity of partial covers of graphs. In Algorithms and Computation, 12th ISAAC '01, Christchurch, New Zealand (2001), no. 2223 in Lecture Notes in Computer Science, Springer Verlag, pp. 537-549.
9. FIALA, J., AND KRATOCHVÍL, J. Partial covers of graphs. Discussiones Mathematicae Graph Theory 22 (2002), 89-99.
10. FIALA, J., KRATOCHVÍL, J., AND KLOKS, T. Fixed-parameter complexity of λ-labelings. Discrete Applied Mathematics 113, 1 (2001), 59-72.
11. GAREY, M. R., AND JOHNSON, D. S. Computers and Intractability. W. H. Freeman and Co., New York, 1979.
12. HEGGERNES, P., AND TELLE, J. A. Partitioning graphs into generalized dominating sets. Nordic Journal of Computing 5, 2 (1998), 128-142.
13. KRATOCHVÍL, J., PROSKUROWSKI, A., AND TELLE, J. A. Covering regular graphs. Journal of Combinatorial Theory B 71, 1 (1997), 1-16.
14. KRISTIANSEN, P., AND TELLE, J. A. Generalized H-coloring of graphs. In Algorithms and Computation, 11th ISAAC '01, Taipei, Taiwan (2000), no. 1969 in Lecture Notes in Computer Science, Springer Verlag, pp. 456-466.
15. ROBERTS, F. S., AND SHENG, L. How hard is it to determine if a graph has a 2-role assignment? Networks 37, 2 (2001), 67-73.