Ključne besede: distance-k dominating set, distance-k edge dominating set, distance-k vertex cover, distance k-edge cover, H-free graph, polynomial-time algorithm, NP-complete problem, dichotomy theoremObjavljeno v RUP: 18.10.2021; Ogledov: 1897; Prenosov: 18 Povezava na celotno besedilo
Ključne besede: distance-k vertex cover, H-free graph, np-completeness, polynomial-time algorithm, dichotomyObjavljeno v RUP: 16.07.2021; Ogledov: 1397; Prenosov: 30 Povezava na celotno besedilo
Ključne besede: graph, vector domination, vector connectivity, submodular set covering problem, approximation algorithm, greedy heuristic, integer linear programmingObjavljeno v RUP: 17.09.2018; Ogledov: 2107; Prenosov: 41 Povezava na celotno besedilo