All-pairs-shortest-length on strongly chordal graphs Original Research Article

The all-pairs-shortest-length (APSL) problem has been quite rigorously studied on various graphs. On general graphs, solutions are known for both the unweighted and weighted cases. Recently Seidel (1992) showed that the APSL problem on unweighted graphs can be solved in O(M(n)log n) time with O(n2) space. Here M(n) denotes the complexity of multiplying two matrices of small integers, which is currently O(n2376).