{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T14:08:10Z","timestamp":1773670090986,"version":"3.50.1"},"reference-count":10,"publisher":"Wiley","issue":"2","license":[{"start":{"date-parts":[[2015,9,1]],"date-time":"2015-09-01T00:00:00Z","timestamp":1441065600000},"content-version":"tdm","delay-in-days":5356,"URL":"http:\/\/doi.wiley.com\/10.1002\/tdm_license_1.1"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Networks"],"published-print":{"date-parts":[[2001,3]]},"DOI":"10.1002\/1097-0037(200103)37:2<67::aid-net1>3.0.co;2-9","type":"journal-article","created":{"date-parts":[[2002,9,11]],"date-time":"2002-09-11T01:09:17Z","timestamp":1031706557000},"page":"67-73","source":"Crossref","is-referenced-by-count":16,"title":["How hard is it to determine if a graph has a 2-role assignment?"],"prefix":"10.1002","volume":"37","author":[{"given":"Fred S.","family":"Roberts","sequence":"first","affiliation":[]},{"given":"Li","family":"Sheng","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2001]]},"reference":[{"key":"BIB1","author":"Cook","year":"1971","unstructured":"The complexity of theorem-proving procedures, Proc 3rd Ann ACM Symp on Theory of Computing, Association for Computing Machinery, New York, 1971, 151-158."},{"key":"BIB2","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/0165-4896(91)90080-B","volume":"21","author":"Everett","year":"1991","journal-title":"Math Soc Sci"},{"key":"BIB3","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1080\/0022250X.1994.9990134","volume":"19","author":"Everett","year":"1994","journal-title":"J Math Soc"},{"key":"BIB4","volume-title":"Computers and intractability, A guide to the theory of NP-completeness","author":"Garey","year":"1979","unstructured":"and Computers and intractability, A guide to the theory of NP-completeness, W.H. Freeman, San Francisco, 1979."},{"key":"BIB5","volume-title":"Algorithmic graph theory and perfect graphs","author":"Golumbic","year":"1980","unstructured":"Algorithmic graph theory and perfect graphs, Academic Press, New York, 1980."},{"key":"BIB6","volume-title":"Applied combinatorics","author":"Roberts","year":"1984","unstructured":"Applied combinatorics, Prentice-Hall, Englewood Cliffs, NJ, 1984."},{"key":"BIB7","first-page":"33","volume-title":"Recent progress in mathematical psychology","author":"Roberts","year":"1998","unstructured":"?Role assignments and indifference graphs,? Recent progress in mathematical psychology, and (Editors), Lawrence Erlbaum Associates, Mahwah, NJ, 1998, 33-46."},{"key":"BIB8","series-title":"Combinatorics","first-page":"729","volume":"II","author":"Roberts","year":"1999","unstructured":"and Role assignments, in Combinatorics, graph theory, and algorithms, and (Editors), New Issues Press, Kalamazoo, MI, 1999, Vol. II, pp. 729-745."},{"key":"BIB9","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/0378-8733(78)90014-X","volume":"1","author":"Sailer","year":"1978","journal-title":"Social Networks"},{"key":"BIB10","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/0378-8733(83)90025-4","volume":"5","author":"White","year":"1983","journal-title":"Social Networks"}],"container-title":["Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2F1097-0037(200103)37:2%3C67::AID-NET1%3E3.0.CO;2-9","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/full\/10.1002\/1097-0037(200103)37:2%3C67::AID-NET1%3E3.0.CO;2-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,1]],"date-time":"2021-07-01T10:27:17Z","timestamp":1625135237000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/1097-0037(200103)37:2<67::AID-NET1>3.0.CO;2-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"references-count":10,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2001,3]]}},"URL":"https:\/\/doi.org\/10.1002\/1097-0037(200103)37:2<67::aid-net1>3.0.co;2-9","relation":{},"ISSN":["0028-3045","1097-0037"],"issn-type":[{"value":"0028-3045","type":"print"},{"value":"1097-0037","type":"electronic"}],"subject":[],"published":{"date-parts":[[2001]]}}}