Author:
Atminas Aistis,Lozin Vadim V.,Razgon Igor
Publisher
Springer Berlin Heidelberg
Reference25 articles.
1. Arbib, C., Mosca, R.: Polynomial algorithms for special cases of the balanced complete bipartite subgraph problem. J. Combin. Math. Combin. Comput. 39, 3–22 (1999)
2. Bascó, G., Tuza, Z.: A characterization of graphs without long induced paths. J. of Graph Theory 14, 455–464 (1990)
3. Binkele-Raible, D., Fernau, H., Gaspers, S., Liedloff, M.: Exact exponential-time algorithms for finding bicliques. Inf. Process. Lett. 111(2), 64–67 (2010)
4. Bodlaender, H.L.: On linear time minor tests with depth-first search. J. Algorithms 14(1), 1–23 (1993)
5. Broersma, H., Golovach, P.A., Paulusma, D., Song, J.: Updating the complexity status of coloring graphs without a fixed induced linear forest. Theor. Comput. Sci. 414(1), 9–19 (2012)
Cited by
26 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献