Articles under category:
Graph Algorithms
Graph Algorithms
Vol 19, Article 2 (pp 1-23)
On Solving Reachability in Grid Digraphs using a Pseudoseparator by Rahul Jain and Raghunath Tewari |
Vol 13, Article 5 (pp 1-47)
[APRX-RND13 Spec Issue]
A Pseudo-Approximation for the Genus of Hamiltonian Graphs by Yury Makarychev, Amir Nayyeri, and Anastasios Sidiropoulos |
Vol 12, Article 18 (pp 1-35)
Upper Bounds on Quantum Query Complexity Inspired by the Elitzur--Vaidman Bomb Tester by Cedric Yen-Yu Lin and Han-Hsuan Lin |
Vol 5, Article 9 (pp 173-189)
All Pairs Bottleneck Paths and Max-Min Matrix Products in Truly Subcubic Time by Virginia Vassilevska, R. Ryan Williams, and Raphael Yuster |