Subject
General Computer Science,Theoretical Computer Science
Reference24 articles.
1. Near-linear time construction of sparse neighborhood covers;Awerbuch;SIAM J. Comput.,1998
2. Sparse partitions;Awerbuch,1990
3. Derandomization, witnesses for Boolean matrix multiplication, and construction of perfect hash functions;Alon;Algorithmica,1996
4. The level ancestor problem simplified;Bender;Theoret. Comput. Sci.,2004
5. Improved sparse covers for graphs excluding a fixed minor;Busch,2007
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Almost Optimal Exact Distance Oracles for Planar Graphs;Journal of the ACM;2023-03-25
2. Optimal Approximate Distance Oracle for Planar Graphs;2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS);2022-02