New diameter-reducing shortcuts and directed hopsets: breaking the O(n) barrier

DOI10.1137/1.9781611977073.55MaRDI QIDQ6575129zbMATH OpenFDO

Authors Shimon Kogan, M. Parter

Publication date 19 July 2024

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

This page was built for publication: New diameter-reducing shortcuts and directed hopsets: breaking the \(O(\sqrt{n})\) barrier

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6575129)