Author:
Beis Mihalis,Duckworth William,Zito Michele
Subject
Applied Mathematics,Computer Graphics and Computer-Aided Design,General Mathematics,Software
Reference36 articles.
1. Maximum matchings in sparse random graphs: Karp–Sipser revisited
2. Large subgraphs of regular graphs, Doctoral Thesis, Department of Mathematics and Statistics, The University of Melbourne, Australia, 2001.
3. On the
$b$
-Independence Number of Sparse Random Graphs
4. , , , , , Complexity and approximation, Springer-Verlag, Berlin, 1999.
5. Lecture notes;Beis,2002
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献