{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T06:14:10Z","timestamp":1743056050751,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030670764"},{"type":"electronic","value":"9783030670771"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","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":[[2021]]},"DOI":"10.1007\/978-3-030-67077-1_9","type":"book-chapter","created":{"date-parts":[[2021,1,7]],"date-time":"2021-01-07T08:41:47Z","timestamp":1610008907000},"page":"150-162","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Convenient Graph Connectedness for\u00a0Digital Imagery"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8843-6842","authenticated-orcid":false,"given":"Josef","family":"\u0160lapal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,1,8]]},"reference":[{"key":"9_CR1","series-title":"Problem Books in Mathematics","doi-asserted-by":"publisher","first-page":"C1","DOI":"10.1007\/978-3-319-97686-0_15","volume-title":"Graph Theory","author":"V Chv\u00e1tal","year":"2018","unstructured":"Chv\u00e1tal, V.: Correction to: a de Bruijn-Erd\u0151s theorem in graphs? In: Gera, R., Haynes, T.W., Hedetniemi, S.T. (eds.) Graph Theory. PBM, pp. C1\u2013C2. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-97686-0_15"},{"key":"9_CR2","volume-title":"General Topology","author":"R Engelking","year":"1977","unstructured":"Engelking, R.: General Topology. Pa\u0144stwowe Wydawnictwo Naukowe, Warszawa (1977)"},{"key":"9_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0166-8641(90)90031-V","volume":"36","author":"ED Khalimsky","year":"1990","unstructured":"Khalimsky, E.D., Kopperman, R., Meyer, P.R.: Computer graphics and connected topologies on finite ordered sets. Topology Appl. 36, 1\u201317 (1990)","journal-title":"Topology Appl."},{"key":"9_CR4","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1155\/S1048953390000041","volume":"3","author":"ED Khalimsky","year":"1990","unstructured":"Khalimsky, E.D., Kopperman, R., Meyer, P.R.: Boundaries in digital plane. J. Appl. Math. Stochast. Anal. 3, 27\u201355 (1990)","journal-title":"J. Appl. Math. Stochast. Anal."},{"key":"9_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1007\/3-540-44438-6_5","volume-title":"Discrete Geometry for Computer Imagery","author":"CO Kiselman","year":"2000","unstructured":"Kiselman, C.O.: Digital jordan curve theorems. In: Borgefors, G., Nystr\u00f6m, I., di Baja, G.S. (eds.) DGCI 2000. LNCS, vol. 1953, pp. 46\u201356. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-44438-6_5"},{"key":"9_CR6","doi-asserted-by":"publisher","first-page":"902","DOI":"10.1080\/00029890.1991.12000810","volume":"98","author":"TY Kong","year":"1991","unstructured":"Kong, T.Y., Kopperman, R., Meyer, P.: A topological approach to digital topology. Amer. Math. Monthly 98, 902\u2013917 (1991)","journal-title":"Amer. Math. Monthly"},{"key":"9_CR7","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/S0734-189X(85)80070-0","volume":"32","author":"TY Kong","year":"1985","unstructured":"Kong, T.Y., Roscoe, W.: A theory of binary digital pictures. Comput. Vision Graphics Image Proc. 32, 221\u2013243 (1985)","journal-title":"Comput. Vision Graphics Image Proc."},{"key":"9_CR8","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1016\/0734-189X(89)90147-3","volume":"48","author":"TY Kong","year":"1989","unstructured":"Kong, T.Y., Rosenfeld, A.: Digital topology: introduction and survey. Comput. Vision Graphics Image Proc. 48, 357\u2013393 (1989)","journal-title":"Comput. Vision Graphics Image Proc."},{"key":"9_CR9","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/BF02574681","volume":"6","author":"R Kopperman","year":"1991","unstructured":"Kopperman, R., Meyer, P.R., Wilson, R.G.: A Jordan surface theorem for three-dimensional digital space. Discrete Comput. Geom. 6, 155\u2013161 (1991)","journal-title":"Discrete Comput. Geom."},{"key":"9_CR10","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/s10851-007-0006-9","volume":"28","author":"E Melin","year":"2007","unstructured":"Melin, E.: Digital surfaces and boundaries in Khalimsky spaces. J. Math. Imaging Vision 28, 169\u2013177 (2007)","journal-title":"J. Math. Imaging Vision"},{"key":"9_CR11","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1016\/j.jat.2007.06.003","volume":"150","author":"E Melin","year":"2008","unstructured":"Melin, E.: Continuous digitization in Khalimsky spaces. J. Approx. Theory 150, 96\u2013116 (2008)","journal-title":"J. Approx. Theory"},{"key":"9_CR12","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1145\/321556.321570","volume":"17","author":"A Rosenfeld","year":"1970","unstructured":"Rosenfeld, A.: Connectivity in digital pictures. J. Assoc. Comput. Math. 17, 146\u2013160 (1970)","journal-title":"J. Assoc. Comput. Math."},{"key":"9_CR13","doi-asserted-by":"publisher","first-page":"621","DOI":"10.1080\/00029890.1979.11994873","volume":"86","author":"A Rosenfeld","year":"1979","unstructured":"Rosenfeld, A.: Digital topology. Amer. Math. Monthly 86, 621\u2013630 (1979)","journal-title":"Amer. Math. Monthly"},{"key":"9_CR14","volume-title":"Picture Languages","author":"A Rosenfeld","year":"1979","unstructured":"Rosenfeld, A.: Picture Languages. Academic Press, New York (1979)"},{"key":"9_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1007\/978-3-642-04397-0_22","volume-title":"Discrete Geometry for Computer Imagery","author":"J \u0160lapal","year":"2009","unstructured":"\u0160lapal, J.: Jordan curve theorems with respect to certain pretopologies on $$\\mathbb{Z}^2$$. In: Brlek, S., Reutenauer, C., Proven\u00e7al, X. (eds.) DGCI 2009. LNCS, vol. 5810, pp. 252\u2013262. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-04397-0_22"},{"key":"9_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1007\/978-3-642-21073-0_13","volume-title":"Combinatorial Image Analysis","author":"J Slapal","year":"2011","unstructured":"Slapal, J.: A jordan curve theorem in the digital plane. In: Aggarwal, J.K., Barneva, R.P., Brimkov, V.E., Koroutchev, K.N., Korutcheva, E.R. (eds.) IWCIA 2011. LNCS, vol. 6636, pp. 120\u2013131. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-21073-0_13"},{"key":"9_CR17","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1016\/j.ins.2013.01.011","volume":"233","author":"J \u0160lapal","year":"2013","unstructured":"\u0160lapal, J.: Graphs with a path partition for structuring digital spaces. Inform. Sci. 233, 305\u2013312 (2013)","journal-title":"Inform. Sci."},{"key":"9_CR18","doi-asserted-by":"publisher","first-page":"305","DOI":"10.2298\/FIL1402305S","volume":"28","author":"J \u0160lapal","year":"2014","unstructured":"\u0160lapal, J.: Convenient adjacencies on $$\\mathbb{Z}^2$$. Filomat 28, 305\u2013312 (2014)","journal-title":"Filomat"}],"container-title":["Lecture Notes in Computer Science","High Performance Computing in Science and Engineering"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-67077-1_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,1,7]],"date-time":"2021-01-07T09:04:50Z","timestamp":1610010290000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-67077-1_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030670764","9783030670771"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-67077-1_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"8 January 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"HPCSE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on High Performance Computing in Science and Engineering","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Karolinka","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Czech Republic","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":"20 May 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 May 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"hpcse2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/hpcse.it4i.cz\/HPCSE19\/","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":"OCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"13","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":"9","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":"69% - 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":"3","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)"}}]}}