Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Greaves, Patrick"'
We show that the VC-dimension of a graph can be computed in time $n^{\log d+1} d^{O(d)}$, where $d$ is the degeneracy of the input graph. The core idea of our algorithm is a data structure to efficiently query the number of vertices that see a specif
Externí odkaz:
http://arxiv.org/abs/2308.08868
