Author:
Agrawal Akanksha,Kundu Madhumita,Sahu Abhishek,Saurabh Saket,Tale Prafullkumar
Funder
European Research Council
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference22 articles.
1. Agrawal, A., Kanesh, L., Saurabh, S., Tale, P.: Paths to trees and cacti. In: International Conference on Algorithms and Complexity, p 31–42. Springer (2017)
2. Aloisio, A., Mkrtchyan, V.: On the fixed-parameter tractability of the maximum 2-edge-colorable subgraph problem. arXiv preprint arXiv:1904.09246 (2019)
3. Alon, N., Yuster, R., Zwick, U.: Color coding. In: M. Kao (ed.) Encyclopedia of Algorithms - 2008 Edition (2008)
4. Cao, Y., Chen, G., Jing, G., Stiebitz, M., Toft, B.: Graph edge coloring: A survey. Graphs and Combinatorics 35(1), 33–66 (2019)
5. Chen, J., Kanj, I.A., Xia, G.: Improved parameterized upper bounds for vertex cover. In: Mathematical Foundations of Computer Science 2006, 31st International Symposium (MFCS), vol. 4162, p 238–249 (2006)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Fixed-Parameter Tractability for Branchwidth of the Maximum-Weight Edge-Colored Subgraph Problem;Lecture Notes on Data Engineering and Communications Technologies;2024
2. Edge Calculation in Tennis Movement Training;2023 International Conference on Power, Communication, Computing and Networking Technologies;2023-09-24