Fast Diameter Computation within Split Graphs

22 Apr 2020 Ducoffe Guillaume IRIF Habib Michel IRIF Viennot Laurent GANG, IRIF

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 Abstract
No code implementations yet. Submit your code now

Categories


  • DATA STRUCTURES AND ALGORITHMS
  • COMBINATORICS