First O(n^{2-1/(2h-2)} polylog n) algorithm for diameter and eccentricity in real-weighted K_h-minor-free digraphs via randomized search-to-decision reduction on VC-dimension.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
Borsuk numbers are introduced for graphs in abstract and continuous settings, along with complexity results, exact values, and upper bounds.
citing papers explorer
-
Real-weighted Diameter and Eccentricity of Minor-free and Bounded VC-dimension Graphs in Truly Subquadratic Time
First O(n^{2-1/(2h-2)} polylog n) algorithm for diameter and eccentricity in real-weighted K_h-minor-free digraphs via randomized search-to-decision reduction on VC-dimension.
-
The Borsuk number of a graph
Borsuk numbers are introduced for graphs in abstract and continuous settings, along with complexity results, exact values, and upper bounds.