Author:
Bui T. N.,Chaudhuri S.,Leighton F. T.,Sipser M.
Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Discrete Mathematics and Combinatorics
Reference20 articles.
1. B. Baker, Approximation Algorithms for NP-complete Problems on Planar Graphs,FOCS 1983, 265–273.
2. E. R. BARNES, An Algorithm for Partitioning the Nodes of a Graph,IBM Technical Report RC8690, 1981.
3. E. R. Barnes andA. J. Hoffman, Partitioning, Spectra and Linear Programming,IBM Research Report, (unknown date).
4. S. N. Bhatt andF. T. Leighton, A Framework for Solving VLSI Graph Layout Problems,Journal of Computer and System Sciences,28 (1984).
5. B. Bollobás, A Probabilistic Proof of an Asymptotic Formula for the Number of Labelled Regular Graphs,European J. Combinatorics,1 (1980), 311–316.
Cited by
170 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献