{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T05:00:32Z","timestamp":1725512432436},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540797081"},{"type":"electronic","value":"9783540797098"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-79709-8_18","type":"book-chapter","created":{"date-parts":[[2008,5,13]],"date-time":"2008-05-13T10:33:17Z","timestamp":1210674797000},"page":"158-167","source":"Crossref","is-referenced-by-count":1,"title":["Comparing Universal Covers in Polynomial Time"],"prefix":"10.1007","author":[{"given":"Ji\u0159\u00ed","family":"Fiala","sequence":"first","affiliation":[]},{"given":"Dani\u00ebl","family":"Paulusma","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: Proceedings of the 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":"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_CR4","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_CR5","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-349-03521-2","volume-title":"Graph Theory with Applications","author":"J.A. Bondy","year":"1976","unstructured":"Bondy, J.A., Murty, U.S.R.: Graph Theory with Applications. Macmillan, London, Elsevier, New York (1976)"},{"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. Fund. Inform.\u00a074, 85\u2013114 (2006)","journal-title":"Fund. Inform."},{"key":"18_CR7","unstructured":"Dantchev, S., Martin, B.D., Stewart, I.A.: On non-definability of unsatisfiability (manuscript)"},{"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 coloring a graph. Mathematical Social Sciences\u00a021, 183\u2013188 (1991)","journal-title":"Mathematical Social Sciences"},{"key":"18_CR9","first-page":"206","volume":"10","author":"J. Fiala","year":"2003","unstructured":"Fiala, J., Heggernes, P., Kristiansen, P., Telle, J.A.: Generalized H-coloring and H-covering of trees. Nordic Journal of Computing\u00a010, 206\u2013224 (2003)","journal-title":"Nordic Journal of Computing"},{"key":"18_CR10","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_CR11","doi-asserted-by":"crossref","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_CR12","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_CR13","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_CR14","doi-asserted-by":"crossref","unstructured":"Fiala, J., Paulusma, D., Telle, J.A.: Locally constrained graph homomorphisms and equitable partitions. European Journal of Combinatorics (to appear)","DOI":"10.1016\/j.ejc.2007.11.006"},{"key":"18_CR15","volume-title":"Algebraic Combinatorics","author":"C. Godsil","year":"1993","unstructured":"Godsil, C.: Algebraic Combinatorics. Chapman and Hall, Boca Raton (1993)"},{"key":"18_CR16","doi-asserted-by":"crossref","DOI":"10.1093\/acprof:oso\/9780198528173.001.0001","volume-title":"Graphs and Homomorphisms","author":"P. Hell","year":"2004","unstructured":"Hell, P., Ne\u0161et\u0159il, J.: Graphs and Homomorphisms. Oxford University Press, Oxford (2004)"},{"key":"18_CR17","first-page":"223","volume":"38","author":"A.J. Hoffman","year":"1956","unstructured":"Hoffman, A.J., Kruskal, J.B.: Integral boundary points of convex polyhedra. Annals of Mathematics Studies\u00a038, 223\u2013246 (1956)","journal-title":"Annals of Mathematics Studies"},{"key":"18_CR18","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1006\/inco.1994.1086","volume":"114","author":"E. Kranakis","year":"1994","unstructured":"Kranakis, E., Krizanc, D., Van den Berg, J.: Computing boolean functions on anonymous networks. Information and Computation\u00a0114, 214\u2013236 (1994)","journal-title":"Information and Computation"},{"key":"18_CR19","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_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"456","DOI":"10.1007\/3-540-40996-3_39","volume-title":"Algorithms and Computation","author":"P. Kristiansen","year":"2000","unstructured":"Kristiansen, P., Telle, J.A.: Generalized H-coloring of graphs. In: Lee, D.T., Teng, S.-H. (eds.) ISAAC 2000. LNCS, vol.\u00a01969, pp. 456\u2013466. Springer, Heidelberg (2000)"},{"key":"18_CR21","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/0095-8956(82)90042-9","volume":"33","author":"F.T. Leighton","year":"1982","unstructured":"Leighton, F.T.: Finite common coverings of graphs. Journal of Combinatorial Theory B\u00a033, 231\u2013238 (1982)","journal-title":"Journal of Combinatorial Theory B"},{"key":"18_CR22","unstructured":"Massey, W.S.: Algebraic Topology: An Introduction. Harcourt (1967)"},{"key":"18_CR23","first-page":"129","volume":"34","author":"E.F. Moore","year":"1956","unstructured":"Moore, E.F.: Gedanken-experiments on sequential machines. Annals of Mathematics Studies\u00a034, 129\u2013153 (1956)","journal-title":"Annals of Mathematics Studies"},{"key":"18_CR24","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1016\/0012-365X(71)90014-8","volume":"1","author":"J. Ne\u0161et\u0159il","year":"1971","unstructured":"Ne\u0161et\u0159il, J.: Homomorphisms of derivative graphs. Discrete Math.\u00a01, 257\u2013268 (1971)","journal-title":"Discrete Math."},{"key":"18_CR25","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/0166-218X(93)E0133-J","volume":"56","author":"N. Norris","year":"1995","unstructured":"Norris, N.: Universal covers of graphs: isomorphism to depth n\u2009\u2212\u20091 implies isomorphism to all depths. Discrete Applied Mathematics\u00a056, 61\u201374 (1995)","journal-title":"Discrete Applied Mathematics"},{"key":"18_CR26","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_CR27","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1109\/71.481599","volume":"7","author":"M. Yamashita","year":"1996","unstructured":"Yamashita, M., Kameda, T.: Computing on anonymous networks: Part I - Characterizing the solvable cases. IEEE Transactions on Parallel and Distributed Systems\u00a07, 69\u201389 (1996)","journal-title":"IEEE Transactions on Parallel and Distributed Systems"}],"container-title":["Lecture Notes in Computer Science","Computer Science \u2013 Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-79709-8_18.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:28:45Z","timestamp":1619508525000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-79709-8_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540797081","9783540797098"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-79709-8_18","relation":{},"subject":[]}}