The random selection of unlabeled graphs
- 作者John D Dixon; Herbert S Wilf
- 卷第4卷
- 期第3期
- 印刷ISSN0196-6774
- 电子ISSN1090-2678
- 文件大小446.95KB
- 发表时间1983
- DOI10.1016/0196-6774(83)90021-4
- 页码205-213
Khachiyan's linear programming algorithmBengt Aspvall; Richard E Stone · 1980
Selecting among scheduled projectsBengt Aspvall; Sjur Didrik Flåm; Kåre P. Villanger · 1995
Graph Coloring Using Eigenvalue DecompositionAspvall, Bengt; Gilbert, John R. · SIAM Journal on Algebraic Discrete Methods · 1984
On 2-QBF truth testing in parallelBengt Aspvall; Christos Levcopoulos; Andrzej Lingas; Robert Storlind · 1996
Minimizing elimination tree height can increase fill more than linearlyBengt Aspvall · 1995
Approximations for the general block distribution of a matrixBengt Aspvall; Magnús M. Halldórsson; Fredrik Manne · 2001
Finding minimum height elimination trees for interval graphs in polynomial timeBengt Aspvall; Pinar Heggernes · BIT Numerical Mathematics · 1994