{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,14]],"date-time":"2026-05-14T21:50:40Z","timestamp":1778795440737,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540672036","type":"print"},{"value":"9783540464648","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/978-3-540-46464-8_5","type":"book-chapter","created":{"date-parts":[[2010,10,20]],"date-time":"2010-10-20T13:43:10Z","timestamp":1287582190000},"page":"59-70","source":"Crossref","is-referenced-by-count":12,"title":["Complexity Issues in Switching of Graphs"],"prefix":"10.1007","author":[{"given":"Andrzej","family":"Ehrenfeucht","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jurriaan","family":"Hage","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tero","family":"Harju","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Grzegorz","family":"Rozenberg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5_CR1","volume-title":"Geometry and Combinatorics: Selected Works of J. J. Seidel","year":"1991","unstructured":"Corneil, D.G., Mathon, R.A. (eds.): Geometry and Combinatorics: Selected Works of J. J. Seidel. Academic Press, London (1991)"},{"key":"5_CR2","unstructured":"Ehrenfeucht, A., Hage, J., Harju, T., Rozenberg, G.: Pancyclicity in switching classes (submitted)"},{"key":"5_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1007\/3-540-57182-5_10","volume-title":"Mathematical Foundations of Computer Science 1993","author":"A. Ehrenfeucht","year":"1993","unstructured":"Ehrenfeucht, A., Rozenberg, G.: An introduction to dynamic labeled 2-structures. In: Borzyszkowski, A.M., Sokolowski, S. (eds.) MFCS 1993. LNCS, vol.\u00a0711, pp. 156\u2013173. Springer, Berlin (1993)"},{"key":"5_CR4","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1017\/S0960129500000554","volume":"4","author":"A. Ehrenfeucht","year":"1994","unstructured":"Ehrenfeucht, A., Rozenberg, G.: Dynamic labeled 2-structures. Mathematical Structures in Computer Science\u00a04, 433\u2013455 (1994)","journal-title":"Mathematical Structures in Computer Science"},{"key":"5_CR5","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, New York (1979)"},{"key":"5_CR6","volume-title":"Topological Graph Theory","author":"J.L. Gross","year":"1987","unstructured":"Gross, J.L., Tucker, T.W.: Topological Graph Theory. Wiley, New York (1987)"},{"key":"5_CR7","unstructured":"Hage, J.: The membership problem for switching classes with skew gains. Accepted for Fundamenta Informaticae"},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"Kratochv\u00edl, J., Ne\u0161et\u0159il, J., Z\u00fdka, O.: On the computational complexity of Seidel\u2019s switching. In: Combinatorics Graphs Complexity, Prague, pp. 161\u2013166. Prachatice (1990)","DOI":"10.1016\/S0167-5060(08)70622-8"},{"key":"#cr-split#-5_CR9.1","unstructured":"Seidel, J.J.: A survey of two-graphs. In: Colloquio Internazionale sulle Teorie Combinatorie (Rome,1973), vol.??I, Rome, pp. 481???511 (1996);"},{"key":"#cr-split#-5_CR9.2","unstructured":"Acc. Naz. Lincei. Reprinted in [1]"},{"key":"5_CR10","first-page":"689","volume-title":"Algebraic Methods in Graph Theory (Proc. Internat. Colloq., Szeged, 1978)","author":"J.J. Seidel","year":"1981","unstructured":"Seidel, J.J., Taylor, D.E.: Two-graphs, a second survey. In: Lovasz, L., S\u00f3s, V.T. (eds.) Algebraic Methods in Graph Theory (Proc. Internat. Colloq., Szeged, 1978), vol.\u00a0II, pp. 689\u2013711. North-Holland, Amsterdam (1981)"},{"key":"5_CR11","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1145\/800133.804355","volume-title":"Proc. 10th Ann. ACM Symp. on theory of Computing","author":"M. Yannakakis","year":"1978","unstructured":"Yannakakis, M.: Node- and edge-deletion NP-complete problems. In: Proc. 10th Ann. ACM Symp. on theory of Computing, pp. 253\u2013264. ACM, New York (1978)"},{"key":"5_CR12","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1016\/0095-8956(89)90063-4","volume":"47","author":"T. Zaslavsky","year":"1989","unstructured":"Zaslavsky, T.: Biased graphs. I. Bias, balance, and gains. J. Combin. Theory, Ser. B\u00a047, 32\u201352 (1989)","journal-title":"J. Combin. Theory, Ser. B"}],"container-title":["Lecture Notes in Computer Science","Theory and Application of Graph Transformations"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-46464-8_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,5]],"date-time":"2019-06-05T16:48:21Z","timestamp":1559753301000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-46464-8_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540672036","9783540464648"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-46464-8_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2000]]}}}