1. |
2. Parallelizing an algorithm to find the maximal clique on interval graphs on graphical processing unitsChristian Trefftz, Andrés Santamaría-Galvis, Roberto Cruz Rodes, 2014, objavljeni znanstveni prispevek na konferenci Ključne besede: graph theory, graphics processing units, parallel algorithms, CUDA, Thrust library, interval graphs, maximal clique Objavljeno v RUP: 18.10.2021; Ogledov: 914; Prenosov: 23 Povezava na celotno besedilo |
3. |
4. |
5. Strong cliques in diamond-free graphsNina Chiarelli, Berenice Martínez-Barona, Martin Milanič, Jérôme Monnot, Peter Muršič, 2020, izvirni znanstveni članek 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 property Objavljeno v RUP: 17.12.2020; Ogledov: 1133; Prenosov: 34 Povezava na celotno besedilo |
6. |
7. Strong cliques in diamond-free graphsNina Chiarelli, Berenice Martínez-Barona, Martin Milanič, Jérôme Monnot, Peter Muršič, 2020, objavljeni znanstveni prispevek na konferenci 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 property Objavljeno v RUP: 10.11.2020; Ogledov: 1274; Prenosov: 34 Povezava na celotno besedilo |
8. |
9. Qiao, Zhi, Koolen, Jack: A new characterization of the dual polar graphs. (English summary). - J. Combin. Theory Ser. B 135 (2019), 200-211Safet Penjić, 2020, recenzija, prikaz knjige, kritika Ključne besede: Distance-regular graph, dual polar graph, Delsarte clique Objavljeno v RUP: 15.04.2020; Ogledov: 1341; Prenosov: 12 Povezava na celotno besedilo |
10. |