Ključne besede: simplicial vertex, avoidable vertex, avoidable edge, avoidable path, maximum weight clique problem, polynomial-time algorithm, hole-cyclically orientable graphObjavljeno v RUP: 20.08.2019; Ogledov: 2067; Prenosov: 156 Povezava na celotno besedilo