On the complexity of the upper \(r\)-tolerant edge cover problem
From MaRDI portal
Publication:1997258
DOI10.1007/978-3-030-57852-7_3OpenAlexW3082332651MaRDI QIDQ1997258
Mehdi Khosravian Ghadikolaei, Ararat Harutyunyan, Aris Pagourtzis, Nikolaos Melissinos, Jérôme Monnot
Publication date: 1 March 2021
Full work available at URL: https://doi.org/10.1007/978-3-030-57852-7_3
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)
Related Items
Extension of some edge graph problems: standard, parameterized and approximation complexity, In)approximability of Maximum Minimal FVS, Algorithmic aspects of upper edge domination, (In)approximability of maximum minimal FVS
Cites Work