most citedThere are only finitely many distance-regular graphs of fixed valency greater than two

2 citations · 2 across the 2 of their papers we have counts for

collaborators
Showing cs.DSShow all

1 paper · 1 filter

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…