{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T12:07:45Z","timestamp":1725538065057},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642034084"},{"type":"electronic","value":"9783642034091"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-03409-1_18","type":"book-chapter","created":{"date-parts":[[2009,9,14]],"date-time":"2009-09-14T10:05:18Z","timestamp":1252922718000},"page":"193-204","source":"Crossref","is-referenced-by-count":0,"title":["Computing Role Assignments of Chordal Graphs"],"prefix":"10.1007","author":[{"given":"Pim","family":"van \u2019t Hof","sequence":"first","affiliation":[]},{"given":"Dani\u00ebl","family":"Paulusma","sequence":"additional","affiliation":[]},{"given":"Johan M. M.","family":"van Rooij","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"18_CR1","first-page":"103","volume":"4","author":"J. Abello","year":"1991","unstructured":"Abello, J., Fellows, M.R., Stillwell, J.C.: On the complexity and combinatorics of covering finite complexes. Australian Journal of Combinatorics\u00a04, 103\u2013112 (1991)","journal-title":"Australian Journal of Combinatorics"},{"key":"18_CR2","doi-asserted-by":"crossref","unstructured":"Angluin, D.: Local and global properties in networks of processors. In: 12th ACM Symposium on Theory of Computing, pp. 82\u201393 (1980)","DOI":"10.1145\/800141.804655"},{"key":"18_CR3","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1016\/0095-8956(81)90062-9","volume":"30","author":"D. Angluin","year":"1981","unstructured":"Angluin, D., Gardiner, A.: Finite common coverings of pairs of regular graphs. Journal of Combinatorial Theory B\u00a030, 184\u2013187 (1981)","journal-title":"Journal of Combinatorial Theory B"},{"key":"18_CR4","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1112\/jlms\/s2-26.2.193","volume":"26","author":"N. Biggs","year":"1982","unstructured":"Biggs, N.: Constructing 5-arc transitive cubic graphs. Journal of London Mathematical Society II\u00a026, 193\u2013200 (1982)","journal-title":"Journal of London Mathematical Society II"},{"key":"18_CR5","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1016\/0743-7315(89)90048-8","volume":"6","author":"H.L. Bodlaender","year":"1989","unstructured":"Bodlaender, H.L.: The classification of coverings of processor networks. Journal of Parallel Distributed Computing\u00a06, 166\u2013182 (1989)","journal-title":"Journal of Parallel Distributed Computing"},{"key":"18_CR6","first-page":"85","volume":"74","author":"J. Chalopin","year":"2006","unstructured":"Chalopin, J., M\u00e9tivier, Y., Zielonka, W.: Local computations in graphs: the case of cellular edge local computations. Fundamenta Informaticae\u00a074, 85\u2013114 (2006)","journal-title":"Fundamenta Informaticae"},{"key":"18_CR7","volume-title":"Graph Theory","author":"R. Diestel","year":"2005","unstructured":"Diestel, R.: Graph Theory, 3rd edn. Springer, Heidelberg (2005)","edition":"3"},{"key":"18_CR8","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0165-4896(91)90080-B","volume":"21","author":"M.G. Everett","year":"1991","unstructured":"Everett, M.G., Borgatti, S.: Role colouring a graph. Mathematical Social Sciences\u00a021, 183\u2013188 (1991)","journal-title":"Mathematical Social Sciences"},{"key":"18_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1007\/3-540-45678-3_46","volume-title":"Algorithms and Computation","author":"J. Fiala","year":"2001","unstructured":"Fiala, J., Kratochv\u00edl, J.: Complexity of partial covers of graphs. In: Eades, P., Takaoka, T. (eds.) ISAAC 2001. LNCS, vol.\u00a02223, pp. 537\u2013549. Springer, Heidelberg (2001)"},{"key":"18_CR10","doi-asserted-by":"publisher","first-page":"89","DOI":"10.7151\/dmgt.1159","volume":"22","author":"J. Fiala","year":"2002","unstructured":"Fiala, J., Kratochv\u00edl, J.: Partial covers of graphs. Discussiones Mathematicae Graph Theory\u00a022, 89\u201399 (2002)","journal-title":"Discussiones Mathematicae Graph Theory"},{"key":"18_CR11","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/S0166-218X(00)00387-5","volume":"113","author":"J. Fiala","year":"2001","unstructured":"Fiala, J., Kratochv\u00edl, J., Kloks, T.: Fixed-parameter complexity of \u03bb-labelings. Discrete Applied Mathematics\u00a0113, 59\u201372 (2001)","journal-title":"Discrete Applied Mathematics"},{"key":"18_CR12","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/j.tcs.2005.09.029","volume":"349","author":"J. Fiala","year":"2005","unstructured":"Fiala, J., Paulusma, D.: A complete complexity classification of the role assignment problem. Theoretical Computer Science\u00a0349, 67\u201381 (2005)","journal-title":"Theoretical Computer Science"},{"key":"18_CR13","unstructured":"Fiala, J., Paulusma, D.: Comparing universal covers in polynomial time. Theory of Computing Systems (to appear)"},{"key":"18_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1007\/3-540-60618-1_88","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"P. Galinier","year":"1995","unstructured":"Galinier, P., Habib, M., Paul, C.: Chordal graphs and their clique graphs. In: Nagl, M. (ed.) WG 1995. LNCS, vol.\u00a01017, pp. 358\u2013371. Springer, Heidelberg (1995)"},{"key":"18_CR15","volume-title":"Computers and Intractability","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability. W.H. Freeman and Co., New York (1979)"},{"key":"18_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/jctb.1996.1743","volume":"71","author":"J. Kratochv\u00edl","year":"1997","unstructured":"Kratochv\u00edl, J., Proskurowski, A., Telle, J.A.: Covering regular graphs. Journal of Combinatorial Theory B\u00a071, 1\u201316 (1997)","journal-title":"Journal of Combinatorial Theory B"},{"key":"18_CR17","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1016\/S0165-4896(00)00064-0","volume":"41","author":"A. Peke\u010d","year":"2001","unstructured":"Peke\u010d, A., Roberts, F.S.: The role assignment model nearly fits most social networks. Mathematical Social Sciences\u00a041, 275\u2013293 (2001)","journal-title":"Mathematical Social Sciences"},{"key":"18_CR18","unstructured":"Rieck, Y., Yamashita, Y.: Finite planar emulators for K 4,5\u2009\u2212\u20094K 2 and Fellows\u2019 conjecture. Manuscript (2009), arXiv:0812.3700v2"},{"key":"18_CR19","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1002\/1097-0037(200103)37:2<67::AID-NET1>3.0.CO;2-9","volume":"37","author":"F.S. Roberts","year":"2001","unstructured":"Roberts, F.S., Sheng, L.: How hard is it to determine if a graph has a 2-role assignment? Networks\u00a037, 67\u201373 (2001)","journal-title":"Networks"},{"key":"18_CR20","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1016\/S0304-3975(03)00084-7","volume":"304","author":"L. Sheng","year":"2003","unstructured":"Sheng, L.: 2-Role assignments on triangulated graphs. Theoretical Computer Science\u00a0304, 201\u2013214 (2003)","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03409-1_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T11:15:45Z","timestamp":1558523745000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03409-1_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642034084","9783642034091"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03409-1_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}