{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:35:43Z","timestamp":1742913343584,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":31,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819981311"},{"type":"electronic","value":"9789819981328"}],"license":[{"start":{"date-parts":[[2023,11,26]],"date-time":"2023-11-26T00:00:00Z","timestamp":1700956800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,11,26]],"date-time":"2023-11-26T00:00:00Z","timestamp":1700956800000},"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":[[2024]]},"DOI":"10.1007\/978-981-99-8132-8_7","type":"book-chapter","created":{"date-parts":[[2023,11,25]],"date-time":"2023-11-25T10:02:23Z","timestamp":1700906543000},"page":"82-94","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On Searching for\u00a0Minimal Integer Representation of\u00a0Undirected Graphs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7329-1468","authenticated-orcid":false,"given":"Victor","family":"Parque","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3371-6182","authenticated-orcid":false,"given":"Tomoyuki","family":"Miyashita","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,11,26]]},"reference":[{"key":"7_CR1","doi-asserted-by":"crossref","unstructured":"Aleardi, L.C., Devillers, O., Schaeffer, G.: Optimal succinct representations of planar maps. In: Proceedings of the Twenty-Second Annual Symposium on Computational Geometry, pp. 309\u2013318 (2006)","DOI":"10.1145\/1137856.1137902"},{"key":"7_CR2","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1007\/s00453-010-9452-7","volume":"62","author":"J Barbay","year":"2012","unstructured":"Barbay, J., Castelli Aleardi, L., He, M., Munro, J.I.: Succinct representation of labeled graphs. Algorithmica 62, 224\u2013257 (2012)","journal-title":"Algorithmica"},{"key":"7_CR3","unstructured":"Blandford, D.K., Blelloch, G.E., Kash, I.A.: Compact representations of separable graphs. In: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 679\u2013688. SODA 2003, Society for Industrial and Applied Mathematics, USA (2003)"},{"key":"7_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1007\/978-3-642-13509-5_13","volume-title":"Combinatorial Pattern Matching","author":"GE Blelloch","year":"2010","unstructured":"Blelloch, G.E., Farzan, A.: Succinct representations of separable graphs. In: Amir, A., Parida, L. (eds.) CPM 2010. LNCS, vol. 6129, pp. 138\u2013150. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13509-5_13"},{"key":"7_CR5","doi-asserted-by":"crossref","unstructured":"Boldi, P., Rosa, M., Santini, M., Vigna, S.: Layered label propagation: a multiresolution coordinate-free ordering for compressing social networks. In: Proceedings of the 20th International Conference on World Wide Web, pp. 587\u2013596 (2011)","DOI":"10.1145\/1963405.1963488"},{"key":"7_CR6","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1016\/j.is.2013.08.003","volume":"39","author":"NR Brisaboa","year":"2014","unstructured":"Brisaboa, N.R., Ladra, S., Navarro, G.: Compact representation of web graphs with extended functionality. Inf. Syst. 39, 152\u2013174 (2014)","journal-title":"Inf. Syst."},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"Buehrer, G., Chellapilla, K.: A scalable pattern mining approach to web graph compression with communities. In: Proceedings of the 2008 International Conference on Web Search and Data Mining, pp. 95\u2013106 (2008)","DOI":"10.1145\/1341531.1341547"},{"issue":"4","key":"7_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1841909.1841913","volume":"4","author":"F Claude","year":"2010","unstructured":"Claude, F., Navarro, G.: Fast and compact web graph representations. ACM Trans. Web (TWEB) 4(4), 1\u201331 (2010)","journal-title":"ACM Trans. Web (TWEB)"},{"issue":"5","key":"7_CR9","doi-asserted-by":"publisher","first-page":"593","DOI":"10.1002\/jgt.3190130509","volume":"13","author":"P Erd\u00f6s","year":"1989","unstructured":"Erd\u00f6s, P., Evans, A.B.: Representations of graphs and orthogonal Latin square graphs. J. Graph Theor. 13(5), 593\u2013595 (1989)","journal-title":"J. Graph Theor."},{"key":"7_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1007\/978-3-540-87744-8_33","volume-title":"Algorithms - ESA 2008","author":"A Farzan","year":"2008","unstructured":"Farzan, A., Munro, J.I.: Succinct representations of arbitrary graphs. In: Halperin, D., Mehlhorn, K. (eds.) ESA 2008. LNCS, vol. 5193, pp. 393\u2013404. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-87744-8_33"},{"key":"7_CR11","first-page":"DS6","volume":"1","author":"JA Gallian","year":"2018","unstructured":"Gallian, J.A.: A dynamic survey of graph labeling. Electron. J. Comb. 1, DS6 (2018)","journal-title":"Electron. J. Comb."},{"key":"7_CR12","doi-asserted-by":"crossref","unstructured":"Ghosh, S., Das, S., Roy, S., Minhazul Islam, S., Suganthan, P.: A differential covariance matrix adaptation evolutionary algorithm for real parameter optimization. Inf. Sci. 182(1), 199\u2013219 (2012), nature-Inspired Collective Intelligence in Theory and Practice","DOI":"10.1016\/j.ins.2011.08.014"},{"issue":"5","key":"7_CR13","doi-asserted-by":"publisher","first-page":"717","DOI":"10.1109\/TEVC.2014.2375933","volume":"19","author":"SM Guo","year":"2015","unstructured":"Guo, S.M., Yang, C.C., Hsu, P.H., Tsai, J.S.H.: Improving differential evolution with a successful-parent-selecting framework. IEEE Trans. Evol. Comput. 19(5), 717\u2013730 (2015). https:\/\/doi.org\/10.1109\/TEVC.2014.2375933","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"3","key":"7_CR14","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1137\/S0895480197325031","volume":"12","author":"X He","year":"1999","unstructured":"He, X., Kao, M.Y., Lu, H.I.: Linear-time succinct encodings of planar graphs via canonical orderings. SIAM J. Discret. Math. 12(3), 317\u2013325 (1999)","journal-title":"SIAM J. Discret. Math."},{"issue":"3","key":"7_CR15","doi-asserted-by":"publisher","first-page":"838","DOI":"10.1137\/S0097539799359117","volume":"30","author":"X He","year":"2000","unstructured":"He, X., Kao, M.Y., Lu, H.I.: A fast general methodology for information-theoretically optimal encodings of graphs. SIAM J. Comput. 30(3), 838\u2013846 (2000)","journal-title":"SIAM J. Comput."},{"key":"7_CR16","doi-asserted-by":"crossref","unstructured":"Jacobson, G.: Space-efficient static trees and graphs. In: 30th Annual Symposium on Foundations of Computer Science, pp. 549\u2013554. IEEE Computer Society (1989)","DOI":"10.1109\/SFCS.1989.63533"},{"key":"7_CR17","doi-asserted-by":"publisher","unstructured":"Katebi, H., Sakallah, K.A., Markov, I.L.: Graph symmetry detection and canonical labeling: differences and synergies. In: Voronkov, A. (ed.) Turing-100 - The Alan Turing Centenary, Manchester, UK, June 22\u201325, 2012. EPiC Series in Computing, vol. 10, pp. 181\u2013195. EasyChair (2012). https:\/\/doi.org\/10.29007\/gzc1","DOI":"10.29007\/gzc1"},{"issue":"1","key":"7_CR18","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1145\/309739.309744","volume":"30","author":"DL Kreher","year":"1999","unstructured":"Kreher, D.L., Stinson, D.R.: Combinatorial algorithms: generation, enumeration, and search. ACM SIGACT News 30(1), 33\u201335 (1999)","journal-title":"ACM SIGACT News"},{"key":"7_CR19","doi-asserted-by":"publisher","unstructured":"Parque, V.: On hybrid heuristics for Steiner trees on the plane with obstacles. In: Zarges, C., Verel, S. (eds.) Evolutionary Computation in Combinatorial Optimization \u2013 21st European Conference, EvoCOP 2021, Held as Part of EvoStar 2021, Virtual Event, April 7\u20139, 2021, Proceedings. Lecture Notes in Computer Science, vol. 12692, pp. 120\u2013135. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-72904-2_8","DOI":"10.1007\/978-3-030-72904-2_8"},{"key":"7_CR20","doi-asserted-by":"crossref","unstructured":"Parque, V., Kobayashi, M., Higashi, M.: Bijections for the numeric representation of labeled graphs. In: 2014 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2014, San Diego, CA, USA, October 5\u20138, 2014, pp. 447\u2013452. IEEE (2014)","DOI":"10.1109\/SMC.2014.6973948"},{"key":"7_CR21","doi-asserted-by":"crossref","unstructured":"Parque, V., Miyashita, T.: On succinct representation of directed graphs. In: 2017 IEEE International Conference on Big Data and Smart Computing, BigComp 2017, Jeju Island, South Korea, February 13\u201316, 2017, pp. 199\u2013205. IEEE (2017)","DOI":"10.1109\/BIGCOMP.2017.7881738"},{"key":"7_CR22","doi-asserted-by":"publisher","unstructured":"Parque, V., Miyashita, T.: On the numerical representation of labeled graphs with self-loops. In: 29th IEEE International Conference on Tools with Artificial Intelligence, ICTAI 2017, Boston, MA, USA, November 6\u20138, 2017, pp. 342\u2013349. IEEE Computer Society (2017). https:\/\/doi.org\/10.1109\/ICTAI.2017.00061","DOI":"10.1109\/ICTAI.2017.00061"},{"key":"7_CR23","doi-asserted-by":"publisher","unstructured":"Parque, V., Miyashita, T.: Numerical representation of modular graphs. In: 2018 IEEE 42nd Annual Computer Software and Applications Conference, COMPSAC 2018, Tokyo, Japan, 23\u201327 July 2018, vol. 1, pp. 819\u2013820. IEEE Computer Society (2018). https:\/\/doi.org\/10.1109\/COMPSAC.2018.00136","DOI":"10.1109\/COMPSAC.2018.00136"},{"key":"7_CR24","doi-asserted-by":"publisher","unstructured":"Parque, V., Miyashita, T.: Obstacle-avoiding Euclidean Steiner trees by n-star bundles. In: IEEE 30th International Conference on Tools with Artificial Intelligence, ICTAI 2018, 5\u20137 November 2018, Volos, Greece, pp. 315\u2013319. IEEE (2018). https:\/\/doi.org\/10.1109\/ICTAI.2018.00057","DOI":"10.1109\/ICTAI.2018.00057"},{"key":"7_CR25","doi-asserted-by":"publisher","unstructured":"Parque, V., Miyashita, T.: On graph representation with smallest numerical encoding. In: 2018 IEEE 42nd Annual Computer Software and Applications Conference, COMPSAC 2018, Tokyo, Japan, 23\u201327 July 2018, vol. 1, pp. 817\u2013818. IEEE Computer Society (2018). https:\/\/doi.org\/10.1109\/COMPSAC.2018.00135","DOI":"10.1109\/COMPSAC.2018.00135"},{"issue":"1","key":"7_CR26","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1109\/TEVC.2007.894200","volume":"12","author":"S Rahnamayan","year":"2008","unstructured":"Rahnamayan, S., Tizhoosh, H.R., Salama, M.M.: Opposition-based differential evolution. IEEE Trans. Evol. Comput. 12(1), 64\u201379 (2008)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"7_CR27","doi-asserted-by":"crossref","unstructured":"Segredo, E., Lalla-Ruiz, E., Hart, E.: A novel similarity-based mutant vector generation strategy for differential evolution. In: Proceedings of the Genetic and Evolutionary Computation Conference, pp. 881\u2013888 (2018)","DOI":"10.1145\/3205455.3205628"},{"issue":"4","key":"7_CR28","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1023\/A:1008202821328","volume":"11","author":"R Storn","year":"1997","unstructured":"Storn, R., Price, K.: Differential evolution-a simple and efficient heuristic for global optimization over continuous spaces. J. Global Optim. 11(4), 341 (1997)","journal-title":"J. Global Optim."},{"key":"7_CR29","doi-asserted-by":"crossref","unstructured":"Sutton, A.M., Lunacek, M., Whitley, L.D.: Differential evolution and non-separability: using selective pressure to focus search. In: Proceedings of the 9th Annual Conference on Genetic and Evolutionary Computation, pp. 1428\u20131435 (2007)","DOI":"10.1145\/1276958.1277221"},{"issue":"3","key":"7_CR30","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/0166-218X(84)90126-4","volume":"8","author":"G Tur\u00e1n","year":"1984","unstructured":"Tur\u00e1n, G.: On the succinct representation of graphs. Discret. Appl. Math. 8(3), 289\u2013294 (1984)","journal-title":"Discret. Appl. Math."},{"issue":"5","key":"7_CR31","doi-asserted-by":"publisher","first-page":"945","DOI":"10.1109\/TEVC.2009.2014613","volume":"13","author":"J Zhang","year":"2009","unstructured":"Zhang, J., Sanderson, A.C.: Jade: adaptive differential evolution with optional external archive. IEEE Trans. Evol. Comput. 13(5), 945\u2013958 (2009)","journal-title":"IEEE Trans. Evol. Comput."}],"container-title":["Communications in Computer and Information Science","Neural Information Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-99-8132-8_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T15:45:52Z","timestamp":1710258352000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-99-8132-8_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11,26]]},"ISBN":["9789819981311","9789819981328"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-981-99-8132-8_7","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2023,11,26]]},"assertion":[{"value":"26 November 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICONIP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Neural Information Processing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Changsha","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","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":"20 November 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 November 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iconip2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/iconip2023.org\/","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":"1274","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":"650","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":"51% - 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.14","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.46","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)"}}]}}