11. 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: 1295; Downloads: 41 Link to full text |
12. 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: 10.11.2020; Views: 1392; Downloads: 38 Link to full text |
13. Edge elimination and weighted graph classesJesse Beisegel, Nina Chiarelli, Ekkehard Köhler, Matjaž Krnc, Martin Milanič, Nevena Pivač, Robert Scheffler, Martin Strehler, 2020, published scientific conference contribution Keywords: edge elimination, weighted graph, split graph, threshold graph, chain graph, linear-time recognition algorithm Published in RUP: 10.11.2020; Views: 1398; Downloads: 34 Link to full text |
14. |
15. Hitro prepoznavanje nekaterih parametričnih grafovskih družin : magistrsko deloNina Klobas, 2020, master's thesis Keywords: posplošeni Petersenovi grafi, I-grafi, dvojno posplošeni Petersenovi grafi, zložene kocke, algoritem prepoznavanja grafov, ciklična regularnost, generalized Petersen graphs, I-graphs, double generalized Peteren graphs, folded cubes, recognition algorithm, cycle regularity Published in RUP: 02.10.2020; Views: 1440; Downloads: 17 Link to full text |
16. Mind the independence gapTinaz Ekim, Didem Gozüpek, Ademir Hujdurović, Martin Milanič, 2020, original scientific article Keywords: maximal independent set, independent dominating set, well-covered graph, hereditary independence gap, polynomial-time algorithm, NP-hard problem Published in RUP: 19.05.2020; Views: 1631; Downloads: 57 Link to full text |
17. |
18. |
19. |
20. Generalizations of simplicial vertices and a new polynomially solvable case of the maximum weight clique problem, National Research University Higher School of Economics, Faculty of Computer Science, Moscow, 21. 8. 19Martin Milanič, 2019, invited lecture at foreign university Keywords: simplicial vertex, avoidable vertex, maximum weight clique problem, polynomial-time algorithm, hole-cyclically orientable graph Published in RUP: 03.09.2019; Views: 1737; Downloads: 16 Link to full text |