[{"ddc":["000"],"language":[{"iso":"eng"}],"department":[{"_id":"MoHe"}],"scopus_import":"1","article_number":"61:1-61:12","oa":1,"project":[{"name":"Static and Dynamic Hierarchical Graph Decompositions","grant_number":"I05982","_id":"bda196b2-d553-11ed-ba76-8e8ee6c21103"}],"article_processing_charge":"Yes","intvolume":"       388","citation":{"mla":"Zheng, Da Wei. “Real-Weighted Diameter and Eccentricities of Minor-Free and Bounded VC-Dimension Graphs in Truly Subquadratic Time.” <i>34th Annual European Symposium on Algorithms</i>, vol. 388, 61:1-61:12, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2026, doi:<a href=\"https://doi.org/10.4230/LIPIcs.ESA.2026.61\">10.4230/LIPIcs.ESA.2026.61</a>.","chicago":"Zheng, Da Wei. “Real-Weighted Diameter and Eccentricities of Minor-Free and Bounded VC-Dimension Graphs in Truly Subquadratic Time.” In <i>34th Annual European Symposium on Algorithms</i>, Vol. 388. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2026. <a href=\"https://doi.org/10.4230/LIPIcs.ESA.2026.61\">https://doi.org/10.4230/LIPIcs.ESA.2026.61</a>.","ieee":"D. W. Zheng, “Real-weighted diameter and eccentricities of minor-free and bounded VC-dimension graphs in truly subquadratic time,” in <i>34th Annual European Symposium on Algorithms</i>, L’Aquila, Italy, 2026, vol. 388.","ama":"Zheng DW. Real-weighted diameter and eccentricities of minor-free and bounded VC-dimension graphs in truly subquadratic time. In: <i>34th Annual European Symposium on Algorithms</i>. Vol 388. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2026. doi:<a href=\"https://doi.org/10.4230/LIPIcs.ESA.2026.61\">10.4230/LIPIcs.ESA.2026.61</a>","apa":"Zheng, D. W. (2026). Real-weighted diameter and eccentricities of minor-free and bounded VC-dimension graphs in truly subquadratic time. In <i>34th Annual European Symposium on Algorithms</i> (Vol. 388). L’Aquila, Italy: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.ESA.2026.61\">https://doi.org/10.4230/LIPIcs.ESA.2026.61</a>","ista":"Zheng DW. 2026. Real-weighted diameter and eccentricities of minor-free and bounded VC-dimension graphs in truly subquadratic time. 34th Annual European Symposium on Algorithms. ESA: European Symposium on Algorithms, LIPIcs, vol. 388, 61:1-61:12.","short":"D.W. Zheng, in:, 34th Annual European Symposium on Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2026."},"conference":{"end_date":"2026-09-04","location":"L’Aquila, Italy","name":"ESA: European Symposium on Algorithms","start_date":"2026-08-31"},"publication_identifier":{"isbn":["9783959774451"],"eissn":["1868-8969"]},"publication_status":"published","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","abstract":[{"text":"We present the first truly subquadratic time algorithm to compute diameter and eccentricities in real-weighted directed graphs with constant distance VC-dimension and strongly sublinear-sized balanced separators. For real-weighted K_h-minor-free digraphs, this runs in O(n^{2-1/(2h-2)} polylog(n)) time.\r\nPrior to this work, truly subquadratic time computation of diameter was only known for real-weighted planar graphs, while extensions to broader classes like minor-free graphs were restricted to unweighted settings. In particular, existing algorithms that use VC-dimension [Ducoffe, Habib, Viennot; SICOMP 2022] [Le, Wulff-Nilsen; SODA 2024] [Chan, Chang, Gao, Le, Kisfaludi-Bak, Zheng; FOCS 2025] work with small integer weights, but do not naturally generalize to real weights. We overcome this barrier by introducing a randomized search-to-decision reduction, demonstrating that VC-dimension is a sufficiently powerful tool in the real-weighted regime.","lang":"eng"}],"corr_author":"1","oa_version":"Published Version","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png"},"acknowledgement":"This project has received funding from the Austrian Science Fund (FWF)\r\ngrant DOI 10.55776/I5982. For open access purposes, the author has applied a CC BY public\r\ncopyright license to any author-accepted manuscript version arising from this submission. Thanks to Jie Gao for feedback on a preliminary version of the manuscript","doi":"10.4230/LIPIcs.ESA.2026.61","volume":388,"quality_controlled":"1","year":"2026","status":"public","date_published":"2026-08-25T00:00:00Z","alternative_title":["LIPIcs"],"_id":"22914","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"conference","arxiv":1,"day":"25","author":[{"id":"af77956b-e859-11ef-8dc9-d301b898e32f","full_name":"Zheng, Da Wei","first_name":"Da Wei","last_name":"Zheng"}],"keyword":["Diameter","eccentricities","minor-free graphs","real weights","VC-dimension"],"file":[{"date_updated":"2026-09-17T09:28:04Z","file_name":"2026_LIPIcsESA_Zheng.pdf","file_size":760002,"relation":"main_file","access_level":"open_access","success":1,"creator":"dernst","content_type":"application/pdf","checksum":"574f50435b092a72041c7365cac3d280","file_id":"22942","date_created":"2026-09-17T09:28:04Z"}],"das_tickbox":"0","OA_type":"gold","external_id":{"arxiv":["2607.01926"]},"OA_place":"publisher","publication":"34th Annual European Symposium on Algorithms","date_created":"2026-09-13T22:01:52Z","has_accepted_license":"1","title":"Real-weighted diameter and eccentricities of minor-free and bounded VC-dimension graphs in truly subquadratic time","month":"08","file_date_updated":"2026-09-17T09:28:04Z","researchdata_availability":"no","date_updated":"2026-09-17T09:31:02Z","fulldoi":"https://doi.org/10.4230/LIPIcs.ESA.2026.61","supplementarymaterial":"no"}]