{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:16:07Z","timestamp":1759637767131},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030364113"},{"type":"electronic","value":"9783030364120"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","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":[[2019]]},"DOI":"10.1007\/978-3-030-36412-0_13","type":"book-chapter","created":{"date-parts":[[2019,12,6]],"date-time":"2019-12-06T00:04:15Z","timestamp":1575590655000},"page":"155-167","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Fast Diameter Computation Within Split\u00a0Graphs"],"prefix":"10.1007","author":[{"given":"Guillaume","family":"Ducoffe","sequence":"first","affiliation":[]},{"given":"Michel","family":"Habib","sequence":"additional","affiliation":[]},{"given":"Laurent","family":"Viennot","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,11,23]]},"reference":[{"key":"13_CR1","doi-asserted-by":"crossref","unstructured":"Abboud, A., Williams, V.V., Wang, J.: Approximation and fixed parameter subquadratic algorithms for radius and diameter in sparse graphs. In: SODA, pp. 377\u2013391. SIAM (2016)","DOI":"10.1137\/1.9781611974331.ch28"},{"issue":"1","key":"13_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/S0097539703437843","volume":"36","author":"R Bar-Yehuda","year":"2006","unstructured":"Bar-Yehuda, R., Halld\u00f3rsson, M., Naor, J., Shachnai, H., Shapira, I.: Scheduling split intervals. SIAM J. Comput. 36(1), 1\u201315 (2006)","journal-title":"SIAM J. Comput."},{"issue":"5","key":"13_CR3","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1016\/0020-0190(79)90117-0","volume":"8","author":"JH Bentley","year":"1979","unstructured":"Bentley, J.H.: Decomposable searching problems. Inf. Process. Lett. 8(5), 244\u2013251 (1979)","journal-title":"Inf. Process. Lett."},{"key":"13_CR4","series-title":"The IMA Volumes in Mathematics and its Applications","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-1-4613-8369-7_1","volume-title":"Graph Theory and Sparse Matrix Computation","author":"JR Blair","year":"1993","unstructured":"Blair, J.R., Peyton, B.: An introduction to chordal graphs and clique trees. In: George, A., Gilbert, J.R., Liu, J.W.H. (eds.) Graph Theory and Sparse Matrix Computation. IMA, vol. 56, pp. 1\u201329. Springer, New York (1993). https:\/\/doi.org\/10.1007\/978-1-4613-8369-7_1"},{"key":"13_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84628-970-5","volume-title":"Graph Theory","author":"JA Bondy","year":"2008","unstructured":"Bondy, J.A., Murty, U.S.R.: Graph Theory. Springer, Berlin (2008)"},{"key":"13_CR6","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/j.entcs.2016.03.005","volume":"322","author":"M Borassi","year":"2016","unstructured":"Borassi, M., Crescenzi, P., Habib, M.: Into the square: on the complexity of some quadratic-time solvable problems. Electron. Notes Theor. Comput. Sci. 322, 51\u201367 (2016)","journal-title":"Electron. Notes Theor. Comput. Sci."},{"issue":"4","key":"13_CR7","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1016\/S0378-8733(99)00019-2","volume":"21","author":"S Borgatti","year":"2000","unstructured":"Borgatti, S., Everett, M.: Models of core\/periphery structures. Soc. Netw. 21(4), 375\u2013395 (2000)","journal-title":"Soc. Netw."},{"issue":"4","key":"13_CR8","doi-asserted-by":"publisher","first-page":"2047","DOI":"10.1137\/14097879X","volume":"29","author":"N Bousquet","year":"2015","unstructured":"Bousquet, N., Lagoutte, A., Li, Z., Parreau, A., Thomass\u00e9, S.: Identifying codes in hereditary classes of graphs and VC-dimension. SIAM J. Discrete Math. 29(4), 2047\u20132064 (2015)","journal-title":"SIAM J. Discrete Math."},{"issue":"1\u20133","key":"13_CR9","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/S0166-218X(97)00125-X","volume":"82","author":"A Brandst\u00e4dt","year":"1998","unstructured":"Brandst\u00e4dt, A., Chepoi, V., Dragan, F.: The algorithmic use of hypertree structure and maximum neighbourhood orderings. Discrete Appl. Math. 82(1\u20133), 43\u201377 (1998)","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"13_CR10","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1006\/jagm.1998.0962","volume":"30","author":"A Brandst\u00e4dt","year":"1999","unstructured":"Brandst\u00e4dt, A., Chepoi, V., Dragan, F.: Distance approximating trees for chordal and dually chordal graphs. J. Algorithms 30(1), 166\u2013184 (1999)","journal-title":"J. Algorithms"},{"issue":"1","key":"13_CR11","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1016\/S0304-3975(03)00424-9","volume":"310","author":"A Brandst\u00e4dt","year":"2004","unstructured":"Brandst\u00e4dt, A., Dragan, F., Le, H., Le, V.: Tree spanners on chordal graphs: complexity and algorithms. Theoret. Comput. Sci. 310(1), 329\u2013354 (2004)","journal-title":"Theoret. Comput. Sci."},{"issue":"4","key":"13_CR12","doi-asserted-by":"publisher","first-page":"897","DOI":"10.1016\/j.disc.2009.10.006","volume":"310","author":"A Brandst\u00e4dt","year":"2010","unstructured":"Brandst\u00e4dt, A., Hundt, C., Mancini, F., Wagner, P.: Rooted directed path graphs are leaf powers. Discrete Math. 310(4), 897\u2013910 (2010)","journal-title":"Discrete Math."},{"key":"13_CR13","unstructured":"Bringmann, K., Husfeldt, T., Magnusson, M.: Multivariate analysis of orthogonal range searching and graph distances parameterized by treewidth. In: IPEC (2018)"},{"issue":"5","key":"13_CR14","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1007\/BF02187743","volume":"4","author":"B Chazelle","year":"1989","unstructured":"Chazelle, B., Welzl, E.: Quasi-optimal range searching in spaces of finite VC-dimension. Discrete Comput. Geom. 4(5), 467\u2013489 (1989)","journal-title":"Discrete Comput. Geom."},{"key":"13_CR15","unstructured":"Chepoi, V., Dragan, F.: Disjoint sets problem (1992)"},{"issue":"2\u20133","key":"13_CR16","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/S0166-218X(00)00281-X","volume":"113","author":"D Corneil","year":"2001","unstructured":"Corneil, D., Dragan, F., Habib, M., Paul, C.: Diameter determination on restricted graph families. Discrete Appl. Math. 113(2\u20133), 143\u2013166 (2001)","journal-title":"Discrete Appl. Math."},{"key":"13_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1007\/3-540-36108-1_17","volume-title":"Distributed Computing","author":"Y Dourisboure","year":"2002","unstructured":"Dourisboure, Y., Gavoille, C.: Improved compact routing scheme for chordal graphs. In: Malkhi, D. (ed.) DISC 2002. LNCS, vol. 2508, pp. 252\u2013264. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-36108-1_17"},{"issue":"1","key":"13_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jalgor.2004.09.002","volume":"57","author":"F Dragan","year":"2005","unstructured":"Dragan, F.: Estimating all pairs shortest paths in restricted graph families: a unified approach. J. Algorithms 57(1), 1\u201321 (2005)","journal-title":"J. Algorithms"},{"key":"13_CR19","unstructured":"Ducoffe, G.: A new application of orthogonal range searching for computing giant graph diameters. In: 2nd Symposium on Simplicity in Algorithms (SOSA 2019) (2019)"},{"key":"13_CR20","doi-asserted-by":"crossref","unstructured":"Ducoffe, G., Habib, M., Viennot, L.: Diameter computation on $$H$$-minor free graphs and graphs of bounded (distance) VC-dimension. Technical report 1907.04385 arXiv (2019)","DOI":"10.1137\/1.9781611975994.117"},{"issue":"2\u20133","key":"13_CR21","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/0012-365X(83)90154-1","volume":"43","author":"M Farber","year":"1983","unstructured":"Farber, M.: Characterizations of strongly chordal graphs. Discrete Math. 43(2\u20133), 173\u2013189 (1983)","journal-title":"Discrete Math."},{"key":"13_CR22","volume-title":"Algorithmic Graph Theory and Perfect Graphs","author":"M Golumbic","year":"2004","unstructured":"Golumbic, M.: Algorithmic Graph Theory and Perfect Graphs, vol. 57. Elsevier, Amsterdam (2004)"},{"issue":"1\u20132","key":"13_CR23","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/S0304-3975(97)00241-7","volume":"234","author":"M Habib","year":"2000","unstructured":"Habib, M., McConnell, R., Paul, C., Viennot, L.: Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing. Theoret. Comput. Sci. 234(1\u20132), 59\u201384 (2000)","journal-title":"Theoret. Comput. Sci."},{"issue":"1\u20132","key":"13_CR24","first-page":"87","volume":"14","author":"P Heggernes","year":"2007","unstructured":"Heggernes, P., Kratsch, D.: Linear-time certifying recognition algorithms and forbidden induced subgraphs. Nord. J. Comput. 14(1\u20132), 87\u2013108 (2007)","journal-title":"Nord. J. Comput."},{"key":"13_CR25","unstructured":"McGuigan, R.: Presentation at NSF-CBMS Conference at Colby College (1977)"},{"issue":"3\u20134","key":"13_CR26","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1080\/00207169008803870","volume":"34","author":"S Olariu","year":"1990","unstructured":"Olariu, S.: A simple linear-time algorithm for computing the center of an interval graph. Int. J. Comput. Math. 34(3\u20134), 121\u2013128 (1990)","journal-title":"Int. J. Comput. Math."},{"key":"13_CR27","doi-asserted-by":"crossref","unstructured":"Roditty, L., Williams, V.V.: Fast approximation algorithms for the diameter and radius of sparse graphs. In: STOC, pp. 515\u2013524. ACM (2013)","DOI":"10.1145\/2488608.2488673"},{"issue":"3","key":"13_CR28","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1016\/0095-8956(83)90050-3","volume":"35","author":"E Scheinerman","year":"1983","unstructured":"Scheinerman, E., West, D.: The interval number of a planar graph: three intervals suffice. J. Comb. Theory, Series B 35(3), 224\u2013239 (1983)","journal-title":"J. Comb. Theory, Series B"},{"issue":"3","key":"13_CR29","doi-asserted-by":"publisher","first-page":"566","DOI":"10.1137\/0213035","volume":"13","author":"R Tarjan","year":"1984","unstructured":"Tarjan, R., Yannakakis, M.: Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs. SIAM J. Comput. 13(3), 566\u2013579 (1984)","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-36412-0_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,2,10]],"date-time":"2021-02-10T17:18:30Z","timestamp":1612977510000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-36412-0_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030364113","9783030364120"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-36412-0_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"23 November 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Combinatorial Optimization and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Xiamen","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":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 December 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 December 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoa2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cocoaconference.org\/index.html","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":"108","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":"49","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":"3.2","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":"10","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}