Ključne besede: graph theory, graphics processing units, parallel algorithms, CUDA, Thrust library, interval graphs, maximal cliqueObjavljeno v RUP: 18.10.2021; Ogledov: 1037; Prenosov: 23 Povezava na celotno besedilo
Ključne besede: maximal clique, maximal stable set, diamond-free graph, strong clique, simplicial clique, strongly perfect graph, CIS graph, NP-hard problem, polynomial-time algorithm, Erdős-Hajnal propertyObjavljeno v RUP: 17.12.2020; Ogledov: 1291; Prenosov: 41 Povezava na celotno besedilo
Ključne besede: maximal clique, maximal stable set, diamond-free graph, strong clique, simplicial clique, CIS graph, NP-hard problem, linear-time algorithm, Erdős-Hajnal propertyObjavljeno v RUP: 10.11.2020; Ogledov: 1391; Prenosov: 38 Povezava na celotno besedilo
Ključne besede: CIS graph, maximal clique, maximal stable set, maximal independent set, randomly internally matchable graph, claw-free graphObjavljeno v RUP: 16.10.2019; Ogledov: 1709; Prenosov: 60 Povezava na celotno besedilo