How hard is it to determine if a graph has a 2-role assignment?

Journal article

Peer reviewed

Fred S. Roberts and Li Sheng

Networks, v 37(2), pp 67-73

Mar 2001

Additional Links

NP-completeness

role assignment

role coloring

social networks

social role

6 Record Views

61 citations in Scopus

Title: How hard is it to determine if a graph has a 2-role assignment?
Creators: Fred S. Roberts - Rutgers, The State University of New Jersey
Li Sheng - Drexel University
Publication Details: Networks, v 37(2), pp 67-73
Publisher: John Wiley & Sons, Inc
Number of pages: 7
Resource Type: Journal article
Language: English
Academic Unit: Mathematics
Web of Science ID: WOS:000167183200001
Scopus ID: 2-s2.0-0035285791
Other Identifier: 991019168238704721

Data related to this publication, from InCites Benchmarking & Analytics tool:

Collaboration types: Domestic collaboration
Web of Science research areas: Computer Science, Hardware & Architecture; Operations Research & Management Science