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, predavanje na tuji univerzi Ključne besede: simplicial vertex, avoidable vertex, maximum weight clique problem, polynomial-time algorithm, hole-cyclically orientable graph Objavljeno v RUP: 03.09.2019; Ogledov: 1992; Prenosov: 17 Povezava na celotno besedilo |
98. On the end-vertex problem of graph searchesJesse Beisegel, Carolin Denkert, Ekkehard Köhler, Matjaž Krnc, Nevena Pivač, Robert Scheffler, Martin Strehler, 2019, izvirni znanstveni članek Ključne besede: end-vertex, graph search, maximum cardinality search, maximal neighborhood search, graph classes Objavljeno v RUP: 22.08.2019; Ogledov: 1792; Prenosov: 48 Povezava na celotno besedilo |
99. |
100. |