Publisher
Springer International Publishing
Reference77 articles.
1. Aboulker, P., Brettell, N., Havet, F., Marx, D., Trotignon, N.: Coloring graphs with constraints on connectivity. J. Graph Theory 85(4), 814–838 (2017)
2. Ahal, S., Rabinovich, Y.: On complexity of the subpattern problem. SIAM J. Discret. Math. 22(2), 629–649 (2008).
https://doi.org/10.1137/S0895480104444776
3. Lecture Notes in Computer Science;MH Albert,2001
4. Alon, N., Yuster, R., Zwick, U.: Color-coding. J. ACM 42(4), 844–856 (1995).
https://doi.org/10.1145/210332.210337
5. Beigel, R.: Finding maximum independent sets in sparse and general graphs. In: Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, Baltimore, Maryland, USA, 17–19 January 1999, pp. 856–857 (1999).
http://dl.acm.org/citation.cfm?id=314500.314969
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献