N. Parthiban
- APX-Hardness and Approximation for the k-Burning Number Problem
2020/06/25 by Debajyoti Mondal, N. Parthiban, Mondal, Debajyoti +5 · 2 citations
Computer Science · #03D15 #68Q25 #Advanced Graph Theory Research #Complexity and Algorithms in Graphs #Computational Complexity (cs.CC) #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Optimization and Search Problems