Iskanje po repozitoriju

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 theorem
Objavljeno v RUP: 18.10.2021; Ogledov: 2826; Prenosov: 19
Povezava na celotno besedilo