Currently sage implements Multisweep algorithm with iFUB to find Diameter of undirected unweighted graph, whose complexity in worst case is O(M*N) M=Number of edges ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback