2 citations · 2 across the 2 of their papers we have counts for
2 papers
cs.DS2009
An algorithm for computing cutpoints in finite metric spaces
A. Dress, K. T. Huber, J. Koolen +2
The theory of the tight span, a cell complex that can be associated to every metric , offers a unifying view on existing approaches for analyzing distance data, in particular fo…
math.CO2009★ 2 cited
There are only finitely many distance-regular graphs of fixed valency greater than two
S. Bang, A. Dubickas, J. H. Koolen +1
In this paper we prove the Bannai-Ito conjecture, namely that there are only finitely many distance-regular graphs of fixed valency greater than two.