Ključne besede: graph theory, graphics processing units, parallel algorithms, CUDA, Thrust library, interval graphs, maximal cliqueObjavljeno v RUP: 18.10.2021; Ogledov: 1421; Prenosov: 24 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: 1864; Prenosov: 84 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: 09.11.2020; Ogledov: 1829; Prenosov: 58 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: 2028; Prenosov: 63 Povezava na celotno besedilo