{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T15:54:53Z","timestamp":1772812493184,"version":"3.50.1"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031433795","type":"print"},{"value":"9783031433801","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-43380-1_2","type":"book-chapter","created":{"date-parts":[[2023,9,22]],"date-time":"2023-09-22T20:29:12Z","timestamp":1695414552000},"page":"16-29","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Reconstructing Graphs from\u00a0Connected Triples"],"prefix":"10.1007","author":[{"given":"Paul","family":"Bastide","sequence":"first","affiliation":[]},{"given":"Linda","family":"Cook","sequence":"additional","affiliation":[]},{"given":"Jeff","family":"Erickson","sequence":"additional","affiliation":[]},{"given":"Carla","family":"Groenland","sequence":"additional","affiliation":[]},{"given":"Marc van","family":"Kreveld","sequence":"additional","affiliation":[]},{"given":"Isja","family":"Mannens","sequence":"additional","affiliation":[]},{"given":"Jordi L.","family":"Vermeulen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,9,23]]},"reference":[{"key":"2_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1007\/978-3-642-33090-2_7","volume-title":"Algorithms \u2013 ESA 2012","author":"M Ahmed","year":"2012","unstructured":"Ahmed, M., Wenk, C.: Constructing street networks from GPS trajectories. In: Epstein, L., Ferragina, P. (eds.) ESA 2012. LNCS, vol. 7501, pp. 60\u201371. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-33090-2_7"},{"issue":"3","key":"2_CR2","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/0020-0190(79)90002-4","volume":"8","author":"B Aspvall","year":"1979","unstructured":"Aspvall, B., Plass, M.F., Tarjan, R.E.: A linear-time algorithm for testing the truth of certain quantified Boolean formulas. Inf. Process. Lett. 8(3), 121\u2013123 (1979)","journal-title":"Inf. Process. Lett."},{"key":"2_CR3","doi-asserted-by":"crossref","unstructured":"Bastide, P., et al.: Reconstructing graphs from connected triples (2023)","DOI":"10.1007\/978-3-031-43380-1_2"},{"key":"2_CR4","series-title":"Graduate Texts in Mathematics","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/978-1-4612-0619-4_7","volume-title":"Modern Graph Theory","author":"B Bollob\u00e1s","year":"1998","unstructured":"Bollob\u00e1s, B.: Random graphs. In: Modern Graph Theory. GTM, vol. 184, pp. 215\u2013252. Springer, New York (1998). https:\/\/doi.org\/10.1007\/978-1-4612-0619-4_7"},{"issue":"3","key":"2_CR5","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1002\/jgt.3190010306","volume":"1","author":"JA Bondy","year":"1977","unstructured":"Bondy, J.A., Hemminger, R.L.: Graph reconstruction - a survey. J. Graph Theory 1(3), 227\u2013268 (1977)","journal-title":"J. Graph Theory"},{"issue":"2","key":"2_CR6","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1002\/jgt.20415","volume":"63","author":"A Bowler","year":"2010","unstructured":"Bowler, A., Brown, P., Fenner, T.: Families of pairs of graphs with a large number of common cards. J. Graph Theory 63(2), 146\u2013163 (2010)","journal-title":"J. Graph Theory"},{"issue":"10","key":"2_CR7","doi-asserted-by":"publisher","first-page":"2361","DOI":"10.1016\/j.dam.2008.06.031","volume":"157","author":"U Brandes","year":"2009","unstructured":"Brandes, U., Cornelsen, S.: Phylogenetic graph models beyond trees. Discrete Appl. Math. 157(10), 2361\u20132369 (2009)","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"2_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1017\/S0963548300000444","volume":"2","author":"PJ Cameron","year":"1993","unstructured":"Cameron, P.J., Martins, C.: A theorem on reconstruction of random graphs. Comb. Probab. Comput. 2(1), 1\u20139 (1993)","journal-title":"Comb. Probab. Comput."},{"key":"2_CR9","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, pp. 197\u2013200. MIT press (2022)"},{"key":"2_CR10","unstructured":"Dey, T.K., Wang, J., Wang, Y.: Graph reconstruction by discrete Morse theory. In: Proceedings of the 34th International Symposium on Computational Geometry. Leibniz International Proceedings in Informatics (LIPIcs), vol. 99, pp. 31:1\u201331:15 (2018)"},{"issue":"4","key":"2_CR11","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 timetable and multicommodity flow problems. SIAM J. Comput. 5(4), 691\u2013703 (1976)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"2_CR12","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/BF01240738","volume":"11","author":"T Feder","year":"1994","unstructured":"Feder, T.: Network flow and 2-satisfiability. Algorithmica 11(3), 291\u2013319 (1994)","journal-title":"Algorithmica"},{"issue":"3","key":"2_CR13","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1145\/828.1884","volume":"31","author":"ML Fredman","year":"1984","unstructured":"Fredman, M.L., Koml\u00f3s, J., Szemer\u00e9di, E.: Storing a sparse table with $$0(1)$$ worst case access time. J. ACM 31(3), 538\u2013544 (1984)","journal-title":"J. ACM"},{"key":"2_CR14","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781316339831","volume-title":"Introduction to Random Graphs","author":"A Frieze","year":"2015","unstructured":"Frieze, A., Karonski, M.: Introduction to Random Graphs. Cambridge University Press, New York (2015)"},{"issue":"3","key":"2_CR15","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/0095-8956(74)90066-5","volume":"16","author":"WB Giles","year":"1974","unstructured":"Giles, W.B.: The reconstruction of outerplanar graphs. J. Comb. Theory Ser. B 16(3), 215\u2013226 (1974)","journal-title":"J. Comb. Theory Ser. B"},{"issue":"2","key":"2_CR16","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1002\/jgt.22616","volume":"96","author":"C Groenland","year":"2021","unstructured":"Groenland, C., Guggiari, H., Scott, A.: Size reconstructibility of graphs. J. Graph Theory 96(2), 326\u2013337 (2021)","journal-title":"J. Graph Theory"},{"key":"2_CR17","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1007\/BFb0066431","volume-title":"Graphs and Combinatorics","author":"F Harary","year":"1974","unstructured":"Harary, F.: A survey of the reconstruction conjecture. In: Bari, R.A., Harary, F. (eds.) Graphs and Combinatorics. LNCS, vol. 406, pp. 18\u201328. Springer, Berlin (1974). https:\/\/doi.org\/10.1007\/BFb0066431"},{"key":"2_CR18","volume-title":"Random Graphs","author":"S Janson","year":"2011","unstructured":"Janson, S., Rucinski, A., Luczak, T.: Random Graphs. John Wiley & Sons, Hoboken (2011)"},{"issue":"4","key":"2_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3199606","volume":"14","author":"S Kannan","year":"2018","unstructured":"Kannan, S., Mathieu, C., Zhou, H.: Graph reconstruction and verification. ACM Trans. Algorithms 14(4), 1\u201330 (2018)","journal-title":"ACM Trans. Algorithms"},{"key":"2_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/978-3-319-57045-7_6","volume-title":"Algorithmic Aspects of Cloud Computing","author":"V Kassiano","year":"2017","unstructured":"Kassiano, V., Gounaris, A., Papadopoulos, A.N., Tsichlas, K.: Mining uncertain graphs: an overview. In: Sellis, T., Oikonomou, K. (eds.) ALGOCLOUD 2016. LNCS, vol. 10230, pp. 87\u2013116. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-57045-7_6"},{"key":"2_CR21","unstructured":"Kelly, P.J.: On Isometric Transformations. Ph.D. thesis, University of Wisconsin (1942)"},{"issue":"2","key":"2_CR22","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1016\/0095-8956(81)90064-2","volume":"30","author":"J Lauri","year":"1981","unstructured":"Lauri, J.: The reconstruction of maximal planar graphs. J. Combi. Theory Ser. B 30(2), 196\u2013214 (1981)","journal-title":"J. Combi. Theory Ser. B"},{"key":"2_CR23","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781316669846","volume-title":"Topics in Graph Automorphisms and Reconstruction","author":"J Lauri","year":"2016","unstructured":"Lauri, J., Scapellato, R.: Topics in Graph Automorphisms and Reconstruction. Cambridge University Press, Cambridge (2016)"},{"issue":"3","key":"2_CR24","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/0020-0255(94)90116-3","volume":"79","author":"JN Mordeson","year":"1994","unstructured":"Mordeson, J.N., Peng, C.S.: Operations on fuzzy graphs. Inf. Sci. 79(3), 159\u2013170 (1994)","journal-title":"Inf. Sci."},{"issue":"2","key":"2_CR25","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1109\/TNSE.2017.2776913","volume":"6","author":"E Mossel","year":"2017","unstructured":"Mossel, E., Ross, N.: Shotgun assembly of labeled graphs. IEEE Trans. Netw. Sci. Eng. 6(2), 145\u2013157 (2017)","journal-title":"IEEE Trans. Netw. Sci. Eng."},{"issue":"2","key":"2_CR26","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/0012-365X(92)90053-I","volume":"102","author":"W Myrvold","year":"1992","unstructured":"Myrvold, W.: The degree sequence is reconstructible from $$n- 1$$ cards. Discrete Math. 102(2), 187\u2013196 (1992)","journal-title":"Discrete Math."},{"key":"2_CR27","unstructured":"Rosenfeld, A.: Fuzzy graphs. In: Zadeh, L.A., Fu, K.S., Tanaka, K., Shimura, M. (eds.) Fuzzy Sets and their Applications to Cognitive and Decision Processes, pp. 77\u201395. Elsevier (1975)"},{"key":"2_CR28","unstructured":"Tutte, W.: All the king\u2019s horses. A guide to reconstruction. Graph Theory Relat. Top., 15\u201333 (1979)"},{"key":"2_CR29","unstructured":"Ulam, S.M.: A Collection of Mathematical Problems, Interscience Tracts in Pure and Applied Mathematics, vol. 8. Interscience Publishers (1960)"}],"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-031-43380-1_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,22]],"date-time":"2023-12-22T11:58:06Z","timestamp":1703246286000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-43380-1_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031433795","9783031433801"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-43380-1_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"23 September 2023","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":"Fribourg","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Switzerland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 June 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 June 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"49","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wg2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/events.unifr.ch\/wg2023\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}