Author:
Kobayashi Kenya,Lin Guohui,Miyano Eiji,Saitoh Toshiki,Suzuki Akira,Utashima Tadatoshi,Yagita Tsuyoshi
Publisher
Springer International Publishing
Reference12 articles.
1. Arnborg, S., Corneil, D.G., Proskurowski, A.: Complexity of finding embeddings in a k-tree. SIAM J. Algeb. Discrete Meth. 8(2), 277–284 (1987)
2. Chen, Y., et al.: Path cover with minimum nontrivial paths and its application in two-machine flow-shop scheduling with a conflict graph. J. Combin. Optim. (online) (2021). https://doi.org/10.1007/s10878-021-00793-3
3. Lecture Notes in Computer Science;Y Chen,2019
4. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, New York (1990)
5. George, S.: On the $$k$$-path partition of graphs. Theoret. Comput. Sci. 290(3), 2147–2155 (2003)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献