Author:
Bezrukov S.,Elsässer R.,Monien B.,Preis R.,Tillich J.-P.
Subject
General Computer Science,Theoretical Computer Science
Reference22 articles.
1. Eigenvalues and expanders;Alon;Combinatorica,1986
2. S.L. Bezroukov, R. Elsässer, B. Monien, R. Preis, J.-P. Tillich, New spectral lower bounds on the bisection width of graphs, in: Workshop on Graph–Theoretic Concepts in Computer Science (WG), Lecture Notes in Computer Science, Vol. 1928, 2000, pp. 23–34.
3. The isoperimetric number of random regular graphs;Bollobas;European J. Combin.,1988
4. Graph bisection algorithms with good average case behaviour;Bui;Combinatorica,1987
5. A lower bound for the smallest eigenvalue of the laplacian;Cheeger;Problems Anal.,1970
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Pathwidth vs Cocircumference;SIAM Journal on Discrete Mathematics;2024-02-26
2. Packing and Covering Induced Subdivisions;SIAM Journal on Discrete Mathematics;2021-01
3. Designing High-Performance Interconnection Networks with Host-Switch Graphs;IEEE Transactions on Parallel and Distributed Systems;2019-02-01
4. Minors in graphs of large θr-girth;European Journal of Combinatorics;2017-10
5. On the VLSI Energy Complexity of LDPC Decoder Circuits;IEEE Transactions on Information Theory;2017