Author:
Conte Alessio,Kurita Kazuhiro,Wasa Kunihiro,Uno Takeaki
Publisher
Springer International Publishing
Reference19 articles.
1. Berger, B., Shor, P.W.: Approximation algorithms for the maximum acyclic subgraph problem. In: ACM-SIAM Symposium on Discrete Algorithms, pp. 236–243 (1990)
2. Borodin, O.V., Kim, S.-J., Kostochka, A.V., West, D.B.: Homomorphisms from sparse graphs with large girth. J. Comb. Theory Ser. B 90(1), 147–159 (2004)
3. Chandran, L.S., Subramanian, C.R.: Girth and treewidth. J. Comb. Theory Ser. B 93(1), 23–32 (2005)
4. Chang, H.-C., Lu, H.-I.: Computing the girth of a planar graph in linear time. SIAM J. Comput. 42(3), 1077–1094 (2013)
5. Lecture Notes in Computer Science;A Conte,2016
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献