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, published scientific conference contribution Keywords: graph theory, graphics processing units, parallel algorithms, CUDA, Thrust library, interval graphs, maximal clique Published in RUP: 18.10.2021; Views: 1296; Downloads: 24 Link to full text |
3. |
4. |
5. Strong cliques in diamond-free graphsNina Chiarelli, Berenice Martínez-Barona, Martin Milanič, Jérôme Monnot, Peter Muršič, 2020, original scientific article Keywords: 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 Published in RUP: 17.12.2020; Views: 1653; Downloads: 72 Link to full text |
6. |
7. Strong cliques in diamond-free graphsNina Chiarelli, Berenice Martínez-Barona, Martin Milanič, Jérôme Monnot, Peter Muršič, 2020, published scientific conference contribution Keywords: maximal clique, maximal stable set, diamond-free graph, strong clique, simplicial clique, CIS graph, NP-hard problem, linear-time algorithm, Erdős-Hajnal property Published in RUP: 09.11.2020; Views: 1659; Downloads: 52 Link to full text |
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, review, book review, critique Keywords: Distance-regular graph, dual polar graph, Delsarte clique Published in RUP: 15.04.2020; Views: 1826; Downloads: 14 Link to full text |
10. |