<?xml version="1.0" encoding="UTF-8"?>
<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/"
         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
<ListRecords>
<oai_dc:dc xmlns="http://www.openarchives.org/OAI/2.0/oai_dc/"
           xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
           xmlns:dc="http://purl.org/dc/elements/1.1/"
           xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
           xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
   	<dc:title>Real-weighted diameter and eccentricities of minor-free and bounded VC-dimension graphs in truly subquadratic time</dc:title>
   	<dc:title>LIPIcs</dc:title>
   	<dc:creator>Zheng, Da Wei</dc:creator>
   	<dc:subject>Diameter</dc:subject>
   	<dc:subject>eccentricities</dc:subject>
   	<dc:subject>minor-free graphs</dc:subject>
   	<dc:subject>real weights</dc:subject>
   	<dc:subject>VC-dimension</dc:subject>
   	<dc:subject>ddc:000</dc:subject>
   	<dc:description>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.
Prior 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.</dc:description>
   	<dc:publisher>Schloss Dagstuhl - Leibniz-Zentrum für Informatik</dc:publisher>
   	<dc:date>2026</dc:date>
   	<dc:type>info:eu-repo/semantics/conferenceObject</dc:type>
   	<dc:type>doc-type:ConferenceObject</dc:type>
   	<dc:type>ConferenceObject</dc:type>
   	<dc:type>http://purl.org/coar/resource_type/c_5794</dc:type>
   	<dc:identifier>https://research-explorer.ista.ac.at/record/22914</dc:identifier>
   	<dc:identifier>https://research-explorer.ista.ac.at/download/22914/22942</dc:identifier>
   	<dc:source>Zheng DW. Real-weighted diameter and eccentricities of minor-free and bounded VC-dimension graphs in truly subquadratic time. In: &lt;i&gt;34th Annual European Symposium on Algorithms&lt;/i&gt;. Vol 388. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2026. doi:&lt;a href=&quot;https://doi.org/10.4230/LIPIcs.ESA.2026.61&quot;&gt;10.4230/LIPIcs.ESA.2026.61&lt;/a&gt;</dc:source>
   	<dc:language>eng</dc:language>
   	<dc:relation>info:eu-repo/semantics/altIdentifier/doi/10.4230/LIPIcs.ESA.2026.61</dc:relation>
   	<dc:relation>info:eu-repo/semantics/altIdentifier/e-issn/1868-8969</dc:relation>
   	<dc:relation>info:eu-repo/semantics/altIdentifier/isbn/9783959774451</dc:relation>
   	<dc:relation>info:eu-repo/semantics/altIdentifier/arxiv/2607.01926</dc:relation>
   	<dc:rights>info:eu-repo/semantics/openAccess</dc:rights>
</oai_dc:dc>
</ListRecords>
</OAI-PMH>
