Constant Arboricity Spectral Sparsifiers
arXiv (Cornell University)(2018)
摘要
We show that every graph is spectrally similar to the union of a constant number of forests. Moreover, we show that Spielman-Srivastava sparsifiers are the union of O(logn) forests. This result can be used to estimate boundaries of small subsets of vertices in nearly optimal query time.
更多查看译文
关键词
Graph Matching,Subgraph Isomorphism
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要