Author:
Duckworth William,Zito Michele
Publisher
Springer Berlin Heidelberg
Reference20 articles.
1. Alekseev, V.E.: Polynomial algorithm for finding the largest independent sets in graphs without forks. Discrete Applied Mathematics 135(1-3), 3–16 (2004)
2. Assiyatun, H.: Large Subgraphs of Regular Graphs. PhD thesis, Department of Mathematics and Statistics - The University of Melbourne (2002)
3. Assiyatun, H., Wormald, N.: 3-star factors in random d-regular graphs. European Journal of Combinatorics 27(8), 1249–1262 (2006)
4. Lecture Notes in Computer Science;H. Assiyatun,2005
5. Baker, B.S.: Approximation algorithms for NP-complete problems on planar graphs. Journal of the Association for Computing Machinery 41(1), 153–180 (1994)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献