All-Pairs 2-Reachability in O(n^w log n) Time

DOI10.4230/LIPIcs.ICALP.2017.74zbMath1441.68183arXiv1612.08075OpenAlexW2741640338MaRDI QIDQ5111405

Loukas Georgiadis, Nikos Parotsidis, Przemysław Uznański, Daniel Graf, Giuseppe F. Italiano

Publication date: 27 May 2020

Full work available at URL: https://arxiv.org/abs/1612.08075

zbMATH Keywords

directed graphsBoolean matrix multiplication2-reachabilityall-dominator trees

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10)

Related Items (2)

Unnamed Item ⋮ Unnamed Item

This page was built for publication: All-Pairs 2-Reachability in O(n^w log n) Time