A New Combinatorial Approach for Sparse Graph Problems
From MaRDI portal
Publication:3521912
DOI10.1007/978-3-540-70575-8_10zbMath1152.68426OpenAlexW1559994276MaRDI QIDQ3521912
Guy E. Blelloch, Virginia Vassilevska Williams, R. Ryan Williams
Publication date: 28 August 2008
Published in: Automata, Languages and Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-70575-8_10
Related Items (5)
A survey of the all-pairs shortest paths problem and its variants in graphs ⋮ A note on the complexity of computing the number of reachable vertices in a digraph ⋮ On minimum witnesses for Boolean matrix multiplication ⋮ A fully polynomial parameterized algorithm for counting the number of reachable vertices in a digraph ⋮ Unnamed Item
This page was built for publication: A New Combinatorial Approach for Sparse Graph Problems
