{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T09:18:55Z","timestamp":1743153535491,"version":"3.40.3"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030002558"},{"type":"electronic","value":"9783030002565"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","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":[[2018]]},"DOI":"10.1007\/978-3-030-00256-5_4","type":"book-chapter","created":{"date-parts":[[2018,9,1]],"date-time":"2018-09-01T08:22:08Z","timestamp":1535790128000},"page":"40-51","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["On Minimum Connecting Transition Sets in Graphs"],"prefix":"10.1007","author":[{"given":"Thomas","family":"Bellitto","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Benjamin","family":"Bergougnoux","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,9,2]]},"reference":[{"key":"4_CR1","unstructured":"Ahmed, M., Lubiw, A.: Shortest paths avoiding forbidden subpaths. In: 26th International Symposium on Theoretical Aspects of Computer Science, STACS 2009, Freiburg, Germany, Proceedings, 26\u201328 February 2009, pp. 63\u201374 (2009)"},{"key":"4_CR2","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/j.tcs.2017.03.044","volume":"717","author":"T Bellitto","year":"2017","unstructured":"Bellitto, T.: Separating codes and traffic monitoring. Theor. Comput. Sci. 717, 73\u201385 (2017)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"4_CR3","first-page":"76","volume":"18","author":"A Kotzig","year":"1968","unstructured":"Kotzig, A.: Moves without forbidden transitions in a graph. Matematick\u00fd \u010dasopis 18(1), 76\u201380 (1968)","journal-title":"Matematick\u00fd \u010dasopis"},{"issue":"2","key":"4_CR4","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/0095-8956(76)90053-8","volume":"21","author":"CC Chen","year":"1976","unstructured":"Chen, C.C., Daykin, D.E.: Graphs with Hamiltonian cycles having adjacent lines different colors. J. Comb. Theory Ser. B 21(2), 135\u2013139 (1976)","journal-title":"J. Comb. Theory Ser. B"},{"key":"4_CR5","doi-asserted-by":"crossref","unstructured":"Gutin, G., Kim, E.J.: Properly coloured cycles and paths: results and open problems. In: Graph Theory, Computational Intelligence and Thought, Essays Dedicated to Martin Charles Golumbic on the Occasion of His 60th Birthday. pp. 200\u2013208 (2009)","DOI":"10.1007\/978-3-642-02029-2_19"},{"issue":"2\u20133","key":"4_CR6","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1016\/S0166-218X(02)00251-2","volume":"126","author":"S Szeider","year":"2003","unstructured":"Szeider, S.: Finding paths in graphs avoiding forbidden transitions. Discret. Appl. Math. 126(2\u20133), 261\u2013273 (2003)","journal-title":"Discret. Appl. Math."},{"key":"4_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/978-3-642-35843-2_23","volume-title":"SOFSEM 2013: Theory and Practice of Computer Science","author":"MM Kant\u00e9","year":"2013","unstructured":"Kant\u00e9, M.M., Laforest, C., Mom\u00e8ge, B.: An exact algorithm to check the existence of (elementary) paths and a generalisation of the cut problem in graphs with forbidden transitions. In: van Emde Boas, P., Groen, F.C.A., Italiano, G.F., Nawrocki, J., Sack, H. (eds.) SOFSEM 2013. LNCS, vol. 7741, pp. 257\u2013267. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-35843-2_23"},{"key":"4_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1007\/978-3-662-53174-7_12","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"MM Kant\u00e9","year":"2016","unstructured":"Kant\u00e9, M.M., Moataz, F.Z., Mom\u00e8ge, B., Nisse, N.: Finding paths in grids with forbidden transitions. In: Mayr, E.W. (ed.) WG 2015. LNCS, vol. 9224, pp. 154\u2013168. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53174-7_12"},{"key":"4_CR9","doi-asserted-by":"crossref","unstructured":"Sudakov, B.: Robustness of graph properties. arXiv (2016)","DOI":"10.1017\/9781108332699.009"},{"key":"4_CR10","doi-asserted-by":"crossref","unstructured":"Bellitto, T., Bergougnoux, B.: On minimum connecting transition sets in graphs. arXiv (2018)","DOI":"10.1007\/978-3-030-00256-5_4"},{"issue":"2","key":"4_CR11","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1137\/0211025","volume":"11","author":"D Lichtenstein","year":"1982","unstructured":"Lichtenstein, D.: Planar formulae and their uses. SIAM J. Comput. 11(2), 329\u2013343 (1982)","journal-title":"SIAM J. Comput."},{"key":"4_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1007\/3-540-45687-2_5","volume-title":"Mathematical Foundations of Computer Science 2002","author":"D Peleg","year":"2002","unstructured":"Peleg, D.: Low stretch spanning trees. In: Diks, K., Rytter, W. (eds.) MFCS 2002. LNCS, vol. 2420, pp. 68\u201380. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45687-2_5"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-00256-5_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T13:24:06Z","timestamp":1710336246000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-00256-5_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030002558","9783030002565"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-00256-5_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"2 September 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WG","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Graph-Theoretic Concepts in Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Cottbus","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 June 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 June 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"44","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wg2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.wg2018.b-tu.de\/","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":"66","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":"45% - 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":"4","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":"11,5","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)"}}]}}