Ključne besede: maximal independent set, independent dominating set, well-covered graph, hereditary independence gap, polynomial-time algorithm, NP-hard problemObjavljeno v RUP: 19.05.2020; Ogledov: 1630; Prenosov: 57 Povezava na celotno besedilo