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. 19Milanič, Martin (Avtor) simplicial vertexavoidable vertexmaximum weight clique problempolynomial-time algorithmhole-cyclically orientable graph20192019-09-03 09:49:20Neznano11907UDK: 51COBISS.SI-ID: 1541487556sl