Print
Lupa

Search the repository Help

A- | A+ | Print
Query: search in
search in
search in
search in
* old and bolonia study programme

Options:
  Reset


1 - 2 / 2
First pagePrevious page1Next pageLast page
1.
Avoidable vertices and edges in graphs
Jesse Beisegel, Maria Chudnovsky, Vladimir Gurvich, Martin Milanič, Mary Servatius, 2019, published scientific conference contribution

Found in: ključnih besedah
Summary of found: ... simplicial vertex, avoidable vertex, avoidable edge, avoidable path,...
Keywords: simplicial vertex, avoidable vertex, avoidable edge, avoidable path, maximum weight clique problem, polynomial-time algorithm, hole-cyclically orientable graph
Published: 20.08.2019; Views: 341; Downloads: 94
URL Full text (0,00 KB)

2.
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. 19
Martin Milanič, 2019, invited lecture at foreign university

Found in: ključnih besedah
Summary of found: ...simplicial vertex, avoidable vertex, maximum weight clique problem, polynomial-time...
Keywords: simplicial vertex, avoidable vertex, maximum weight clique problem, polynomial-time algorithm, hole-cyclically orientable graph
Published: 03.09.2019; Views: 241; Downloads: 1
URL Full text (0,00 KB)

Search done in 0 sec.
Back to top
Logos of partners University of Maribor University of Ljubljana University of Primorska University of Nova Gorica