When can we compute the diameter of a graph in quasi linear time? We address this question for the class of split graphs, that we observe to be the hardest instances for deciding whether the diameter is at most two... (read more)

PDF- DATA STRUCTURES AND ALGORITHMS

- COMBINATORICS