{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T09:45:25Z","timestamp":1743068725764,"version":"3.40.3"},"publisher-location":"Cham","reference-count":33,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030967307"},{"type":"electronic","value":"9783030967314"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-030-96731-4_26","type":"book-chapter","created":{"date-parts":[[2022,3,16]],"date-time":"2022-03-16T00:03:49Z","timestamp":1647389029000},"page":"315-327","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Vertex-Weighted Graphs: Realizable and Unrealizable Domains"],"prefix":"10.1007","author":[{"given":"Amotz","family":"Bar-Noy","sequence":"first","affiliation":[]},{"given":"Toni","family":"B\u00f6hnlein","sequence":"additional","affiliation":[]},{"given":"David","family":"Peleg","sequence":"additional","affiliation":[]},{"given":"Dror","family":"Rawitz","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,3,16]]},"reference":[{"key":"26_CR1","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/0012-365X(94)00104-Q","volume":"136","author":"M Aigner","year":"1994","unstructured":"Aigner, M., Triesch, E.: Realizability and uniqueness in graphs. Discr. Math. 136, 3\u201320 (1994)","journal-title":"Discr. Math."},{"doi-asserted-by":"publisher","unstructured":"Alth\u00f6fer, I.: On optimal realizations of finite metric spaces by graphs. Discr. Comput. Geometry 3(2), 103\u2013122 (1988). https:\/\/doi.org\/10.1007\/BF02187901","key":"26_CR2","DOI":"10.1007\/BF02187901"},{"unstructured":"Bar-Noy, A., B\u00f6hnlein, T., Lotker, Z., Peleg, D., Rawitz, D.: The generalized microscopic image reconstruction problem. In: 30th ISAAC, pp. 1\u201315 (2019)","key":"26_CR3"},{"doi-asserted-by":"crossref","unstructured":"Bar-Noy, A., B\u00f6hnlein, T., Lotker, Z., Peleg, D., Rawitz, D.: Weighted microscopic image reconstruction. In: 47th SOFSEM (to appear) (2021)","key":"26_CR4","DOI":"10.1007\/978-3-030-67731-2_27"},{"doi-asserted-by":"crossref","unstructured":"Bar-Noy, A., B\u00f6hnlein, T., Peleg, D., Rawitz, D.: On vertex-weighted graph realizations. In: 12th Conference on Algorithms and Complexity (CIAC) (2021)","key":"26_CR5","DOI":"10.1007\/978-3-030-75242-2_6"},{"doi-asserted-by":"crossref","unstructured":"Bar-Noy, A., Choudhary, K., Peleg, D., Rawitz, D.: Realizability of graph specifications: characterizations and algorithms. In: 25th SIROCCO, pp. 3\u201313 (2018)","key":"26_CR6","DOI":"10.1007\/978-3-030-01325-7_1"},{"key":"26_CR7","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1016\/j.tcs.2019.12.020","volume":"807","author":"A Bar-Noy","year":"2020","unstructured":"Bar-Noy, A., Peleg, D., Rawitz, D.: Vertex-weighted realizations of graphs. Theor. Comput. Sci. 807, 56\u201372 (2020)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"26_CR8","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1080\/15427951.2010.557277","volume":"6","author":"JK Blitzstein","year":"2010","unstructured":"Blitzstein, J.K., Diaconis, P.: A sequential importance sampling algorithm for generating random graphs with prescribed degrees. Internet Math. 6(4), 489\u2013522 (2010)","journal-title":"Internet Math."},{"doi-asserted-by":"crossref","unstructured":"Choudum, S.A.: A simple proof of the Erd\u00f6s-Gallai theorem on graph sequences. Bull. Australian Math. Soc. 33(1), 67\u201370 (1986)","key":"26_CR9","DOI":"10.1017\/S0004972700002872"},{"issue":"3","key":"26_CR10","doi-asserted-by":"publisher","first-page":"432","DOI":"10.1006\/jcss.2001.1785","volume":"63","author":"FRK Chung","year":"2001","unstructured":"Chung, F.R.K., Garrett, M.W., Graham, R.L., Shallcross, D.: Distance realization problems with applications to internet tomography. J. Comput. Syst. Sci. 63(3), 432\u2013448 (2001)","journal-title":"J. Comput. Syst. Sci."},{"issue":"3","key":"26_CR11","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1080\/15427951.2016.1164768","volume":"12","author":"B Cloteaux","year":"2016","unstructured":"Cloteaux, B.: Fast sequential creation of random realizations of degree sequences. Internet Math. 12(3), 205\u2013219 (2016)","journal-title":"Internet Math."},{"issue":"4","key":"26_CR12","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/0020-0190(89)90216-0","volume":"30","author":"JC Culberson","year":"1989","unstructured":"Culberson, J.C., Rudnicki, P.: A fast algorithm for constructing trees from distance matrices. Inf. Process. Lett. 30(4), 215\u2013220 (1989)","journal-title":"Inf. Process. Lett."},{"doi-asserted-by":"crossref","unstructured":"Erd\u00f6s, D., Gemulla, R., Terzi, E.: Reconstructing graphs from neighborhood data. ACM Trans. Knowl. Discov. Data, 8(4), 1\u201322 (2014)","key":"26_CR13","DOI":"10.1145\/2641761"},{"key":"26_CR14","first-page":"264","volume":"11","author":"P Erd\u00f6s","year":"1960","unstructured":"Erd\u00f6s, P., Gallai, T.: Graphs with prescribed degrees of vertices [hungarian]. Matematikai Lapok 11, 264\u2013274 (1960)","journal-title":"Matematikai Lapok"},{"doi-asserted-by":"crossref","unstructured":"Feder, T., Meyerson, A., Motwani, R., O\u2019Callaghan, L., Panigrahy, R.: Representing graph metrics with fewest edges. In: 20th STACS, pp. 355\u2013366 (2003)","key":"26_CR15","DOI":"10.1007\/3-540-36494-3_32"},{"unstructured":"Frank, A.: Connectivity augmentation problems in network design. In: Mathematical Programming: State of the Art. University Michigan, pp. 34\u201363 (1994)","key":"26_CR16"},{"doi-asserted-by":"crossref","unstructured":"Frank, H., Chou, W.: Connectivity considerations in the design of survivable networks. IEEE Trans. Circuit Theory, CT-17, 486\u2013490 (1970)","key":"26_CR17","DOI":"10.1109\/TCT.1970.1083185"},{"issue":"3","key":"26_CR18","doi-asserted-by":"publisher","first-page":"496","DOI":"10.1137\/0110037","volume":"10","author":"SL Hakimi","year":"1962","unstructured":"Hakimi, S.L.: On realizability of a set of integers as degrees of the vertices of a linear graph -I. SIAM J. Appl. Math. 10(3), 496\u2013506 (1962)","journal-title":"SIAM J. Appl. Math."},{"key":"26_CR19","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1090\/qam\/184873","volume":"22","author":"SL Hakimi","year":"1965","unstructured":"Hakimi, S.L., Yau, S.S.: Distance matrix of a graph and its realizability. Quart. Appl. Math. 22, 305\u2013317 (1965)","journal-title":"Quart. Appl. Math."},{"key":"26_CR20","doi-asserted-by":"publisher","first-page":"477","DOI":"10.21136\/CPM.1955.108220","volume":"80","author":"V Havel","year":"1955","unstructured":"Havel, V.: A remark on the existence of finite graphs [in Czech]. Casopis Pest. Mat. 80, 477\u2013480 (1955)","journal-title":"Casopis Pest. Mat."},{"unstructured":"Mihail, M., Vishnoi, N.: On generating graphs with prescribed degree sequences for complex network modeling applications. In: 3rd ARACNE (2002)","key":"26_CR21"},{"issue":"1\/2","key":"26_CR22","first-page":"29","volume":"12","author":"J Nieminen","year":"1976","unstructured":"Nieminen, J.: Realizing the distance matrix of a graph. J. Inf. Process. Cybern. 12(1\/2), 29\u201331 (1976)","journal-title":"J. Inf. Process. Cybern."},{"key":"26_CR23","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/BFb0092288","volume-title":"Combinatorics and Graph Theory","author":"SB Rao","year":"1981","unstructured":"Rao, S.B.: A survey of the theory of potentially P-graphic and forcibly P-graphic degree sequences. In: Rao, Siddani Bhaskara (ed.) Combinatorics and Graph Theory. LNM, vol. 885, pp. 417\u2013440. Springer, Heidelberg (1981). https:\/\/doi.org\/10.1007\/BFb0092288"},{"issue":"2","key":"26_CR24","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1002\/jgt.3190150209","volume":"15","author":"G Sierksma","year":"1991","unstructured":"Sierksma, G., Hoogeveen, H.: Seven criteria for integer sequences being graphic. J. Graph Theory 15(2), 223\u2013231 (1991)","journal-title":"J. Graph Theory"},{"issue":"3","key":"26_CR25","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1016\/0012-365X(90)90337-H","volume":"79","author":"JMS Sim\u00f5es-Pereira","year":"1990","unstructured":"Sim\u00f5es-Pereira, J.M.S.: An algorithm and its role in the study of optimal graph realizations of distance matrices. Discret. Math. 79(3), 299\u2013312 (1990)","journal-title":"Discret. Math."},{"key":"26_CR26","doi-asserted-by":"publisher","first-page":"e201302004","DOI":"10.5936\/csbj.201302004","volume":"5","author":"A Tatsuya","year":"2013","unstructured":"Tatsuya, A., Nagamochi, H.: Comparison and enumeration of chemical graphs. Computat. Struct. Biotechnol. 5, e201302004 (2013)","journal-title":"Computat. Struct. Biotechnol."},{"issue":"18","key":"26_CR27","doi-asserted-by":"publisher","first-page":"3513","DOI":"10.1016\/j.dam.2008.03.033","volume":"156","author":"A Tripathi","year":"2008","unstructured":"Tripathi, A., Tyagi, H.: A simple criterion on degree sequences of graphs. Discr. Appl. Math. 156(18), 3513\u20133517 (2008)","journal-title":"Discr. Appl. Math."},{"issue":"4","key":"26_CR28","doi-asserted-by":"publisher","first-page":"843","DOI":"10.1016\/j.disc.2009.09.023","volume":"310","author":"A Tripathi","year":"2010","unstructured":"Tripathi, A., Venugopalan, S., West, D.B.: A short constructive proof of the erdos-gallai characterization of graphic lists. Discr. Math. 310(4), 843\u2013844 (2010)","journal-title":"Discr. Math."},{"issue":"1\u20133","key":"26_CR29","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1016\/S0012-365X(02)00886-5","volume":"265","author":"A Tripathi","year":"2003","unstructured":"Tripathi, A., Vijay, S.: A note on a theorem of erd\u00f6s & gallai. Discr. Math. 265(1\u20133), 417\u2013420 (2003)","journal-title":"Discr. Math."},{"key":"26_CR30","doi-asserted-by":"publisher","first-page":"734","DOI":"10.1007\/BF01070234","volume":"23","author":"RI Tyshkevich","year":"1987","unstructured":"Tyshkevich, R.I., Chernyak, A.A., Chernyak, Z.A.: Graphs and degree sequences: a survey. I. Cybernetics 23, 734\u2013745 (1987)","journal-title":"I. Cybernetics"},{"key":"26_CR31","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/BF01082602","volume":"24","author":"RI Tyshkevich","year":"1988","unstructured":"Tyshkevich, R.I., Chernyak, A.A., Chernyak, Z.A.: Graphs and degree sequences: a survey. II. Cybernetics 24, 137\u2013152 (1988)","journal-title":"II. Cybernetics"},{"key":"26_CR32","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1007\/BF01255665","volume":"24","author":"RI Tyshkevich","year":"1988","unstructured":"Tyshkevich, R.I., Chernyak, A.A., Chernyak, Z.A.: Graphs and degree sequences: a survey. III. Cybernetics 24, 539\u2013548 (1988)","journal-title":"III. Cybernetics"},{"issue":"1","key":"26_CR33","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1016\/j.ejor.2005.02.071","volume":"174","author":"SC Varone","year":"2006","unstructured":"Varone, S.C.: A constructive algorithm for realizing a distance matrix. Eur. J. Oper. Res. 174(1), 102\u2013111 (2006)","journal-title":"Eur. J. Oper. Res."}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-96731-4_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,16]],"date-time":"2022-03-16T00:06:47Z","timestamp":1647389207000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-96731-4_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783030967307","9783030967314"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-96731-4_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"16 March 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WALCOM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference and Workshops on Algorithms and Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Jember","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Indonesia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 March 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 March 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"walcom2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/walcom2022.unej.ac.id\/","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":"89","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":"34% - 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":"2-9","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)"}},{"value":"The proceedings also include 3 invited papers.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}