Author

Édouard Bonnet

h-index 2 View on Semantic Scholar

We have 1 of 6 papers

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Aug 2026

Time-Optimal APSP and Matrix Multiplication in Classes of Linear Neighborhood Complexity

This work presents $O(n^2)$-time optimal algorithms for $n$-vertex graphs coming from a class of linear neighborhood complexity for the following problems: All-Pairs Shortest Paths, and the multiplication of the adjacency matrix of the input graph with any $n \times n$ matrix.

Édouard Bonnet, Julien Duron, M. Pilipczuk et al. · 0 citations