Publisher
Springer Berlin Heidelberg
Reference20 articles.
1. Andersen, R., Chung, F., Lang, K.: Local graph partitioning using pagerank vectors. In: Proceedings of the 47th Annual IEEE Symposium on Founation of Computer Science (FOCS 2006), pp. 475–486 (2006)
2. Lecture Notes in Computer Science;R. Andersen,2007
3. Brin, S., Page, L.: The anatomy of a large-scale hypertextual Web search engine. Computer Networks and ISDN Systems 30(1-7), 107–117 (1998)
4. Cheeger, J.: A lower bound for the smallest eigenvalue of the Laplacian. In: Gunning, R.C. (ed.) Problems in Analysis, pp. 195–199. Princeton Univ. Press, Princeton (1970)
5. Chung, F.: Spectral Graph Theory. AMS Publications (1997)
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Bootstrap Deep Metric for Seed Expansion in Attributed Networks;Proceedings of the 47th International ACM SIGIR Conference on Research and Development in Information Retrieval;2024-07-10
2. Sublinear Algorithms for Local Graph-Centrality Estimation;SIAM Journal on Computing;2023-08-10
3. Krylov Subspace Approximation for Local Community Detection in Large Networks;ACM Transactions on Knowledge Discovery from Data;2019-10-12
4. Sublinear Algorithms for Local Graph Centrality Estimation;2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS);2018-10
5. Local Lanczos Spectral Approximation for Community Detection;Machine Learning and Knowledge Discovery in Databases;2017