91. |
92. |
93. |
94. |
95. |
96. |
97. 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: 1739; Downloads: 16 Link to full text |
98. On the end-vertex problem of graph searchesJesse Beisegel, Carolin Denkert, Ekkehard Köhler, Matjaž Krnc, Nevena Pivač, Robert Scheffler, Martin Strehler, 2019, original scientific article Keywords: end-vertex, graph search, maximum cardinality search, maximal neighborhood search, graph classes Published in RUP: 22.08.2019; Views: 1600; Downloads: 47 Link to full text |
99. |
100. |