Skip to main content
Share Your Experience: Take the 2024 Developer Survey

New answers tagged

0 votes

The existence of a (nearly) quadratic time algorithm for 2-steps shortest path or smallest triangle

Your first problem basically boils down to a transitive closure in a graph. Here, matrix multiplication can be used. The best-known algorithm to date has a complexity of $n^{2.371552}$. In my opinion, ...
codeR's user avatar
  • 987

Top 50 recent answers are included