{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,14]],"date-time":"2026-05-14T21:50:50Z","timestamp":1778795450433,"version":"3.51.4"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030174019","type":"print"},{"value":"9783030174026","type":"electronic"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-17402-6_28","type":"book-chapter","created":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T13:37:00Z","timestamp":1558359420000},"page":"339-351","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Complexity of Vertex Switching on Edge-Bicolored Graphs"],"prefix":"10.1007","author":[{"given":"Ho Lam","family":"Pang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Leizhen","family":"Cai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,4,6]]},"reference":[{"issue":"1","key":"28_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1002\/bs.3830030102","volume":"3","author":"RP Abelson","year":"1958","unstructured":"Abelson, R.P., Rosenberg, M.J.: Symbolic psycho-logic: a model of attitudinal cognition. Behav. Sci. 3(1), 1\u201313 (1958)","journal-title":"Behav. Sci."},{"key":"28_CR2","unstructured":"Dodis, Y., Winkler, P.: Universal configurations in light-flipping games. In: Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 926\u2013927 (2001)"},{"key":"28_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/978-3-540-46464-8_5","volume-title":"Theory and Application of Graph Transformations","author":"A Ehrenfeucht","year":"2000","unstructured":"Ehrenfeucht, A., Hage, J., Harju, T., Rozenberg, G.: Complexity issues in switching of graphs. In: Ehrig, H., Engels, G., Kreowski, H.-J., Rozenberg, G. (eds.) TAGT 1998. LNCS, vol. 1764, pp. 59\u201370. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/978-3-540-46464-8_5"},{"issue":"4","key":"28_CR4","doi-asserted-by":"publisher","first-page":"691","DOI":"10.1137\/0205048","volume":"5","author":"S Even","year":"1976","unstructured":"Even, S., Itai, A., Shamir, A.: On the complexity of time table and multi-commodity flow problems. SIAM J. Comput. 5(4), 691\u2013703 (1976)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"28_CR5","doi-asserted-by":"publisher","first-page":"635","DOI":"10.1137\/S0895480101395245","volume":"16","author":"J Fiala","year":"2003","unstructured":"Fiala, J., Jansen, K., Le, V.B., Seidel, E.: Graph subcolorings: complexity and algorithms. SIAM J. Discrete Math. 16(4), 635\u2013650 (2003)","journal-title":"SIAM J. Discrete Math."},{"key":"28_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1007\/3-540-45832-8_13","volume-title":"Graph Transformation","author":"J Hage","year":"2002","unstructured":"Hage, J., Harju, T., Welzl, E.: Euler graphs, triangle-free graphs and bipartite graphs in switching classes. In: Corradini, A., Ehrig, H., Kreowski, H.-J., Rozenberg, G. (eds.) ICGT 2002. LNCS, vol. 2505, pp. 148\u2013160. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45832-8_13"},{"key":"28_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/978-3-540-39890-5_26","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"J Kratochv\u00edl","year":"2003","unstructured":"Kratochv\u00edl, J.: Complexity of hypergraph coloring and Seidel\u2019s switching. In: Bodlaender, H.L. (ed.) WG 2003. LNCS, vol. 2880, pp. 297\u2013308. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-39890-5_26"},{"key":"28_CR8","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/S0167-5060(08)70622-8","volume":"51","author":"J Kratochv\u00edl","year":"1992","unstructured":"Kratochv\u00edl, J., Nes\u0302etril, J., Z\u1ef3ka, O.: On the computational complexity of Seidel\u2019s switching. Ann. Discrete Math. 51, 161\u2013166 (1992)","journal-title":"Ann. Discrete Math."},{"key":"28_CR9","unstructured":"Lov\u00e1sz, L.: Coverings and colorings of hypergraphs. In: Proceedings of the 4th Southeastern Conference on Combinatorics, Graph Theory, and Computing, pp. 3\u201312 (1973)"},{"key":"28_CR10","doi-asserted-by":"crossref","unstructured":"Seidel, J.J.: A survey of two-graphs. In: Geometry and Combinatorics, pp. 146\u2013176. Elsevier (1991)","DOI":"10.1016\/B978-0-12-189420-7.50018-9"},{"issue":"1","key":"28_CR11","first-page":"1","volume":"29","author":"Y Wu","year":"1996","unstructured":"Wu, Y., Yuan, J., Zhao, Y.: Partition a graph into two induced forests. J. Math. Study 29(1), 1\u20136 (1996)","journal-title":"J. Math. Study"},{"issue":"1","key":"28_CR12","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/0166-218X(82)90033-6","volume":"4","author":"T Zaslavsky","year":"1982","unstructured":"Zaslavsky, T.: Signed graphs. Discrete Appl. Math. 4(1), 47\u201374 (1982)","journal-title":"Discrete Appl. Math."},{"key":"28_CR13","doi-asserted-by":"crossref","unstructured":"Zaslavsky, T.: A mathematical bibliography of signed and gain graphs and allied areas. Electr. J. Comb. DS8 (2018)","DOI":"10.37236\/29"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-17402-6_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T12:57:42Z","timestamp":1710334662000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-17402-6_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030174019","9783030174026"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-17402-6_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"6 April 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CIAC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithms and Complexity","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Rome","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 May 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 May 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ciac2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/easyconferences.eu\/ciac2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"95","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"30","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"32% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"14","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}