Now showing items 1-1 of 1
Conflicting edges spanning trees and NP-Hard subgraph identification problems
(Universita degli studi di Salerno, 2018-04-17)
How often do we try to get the best result with the least effort, spend as little time as possible to perform a task or make the most of the resources available in the workplace? In everyday life, the word ”optimize” is ...