Login
Lupa
First page / Search the repository

Search the repository Help

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

Options:
  Reset


1 - 1 / 1
First pagePrevious page1Next pageLast page
1.
Parallelizing an algorithm to decide if a bipartite graph is shellable
Andrés Santamaría-Galvis, Roberto Cruz Rodes, Christian Trefftz, John W. Branch, 2013, published scientific conference contribution

Keywords: graph theory, parallel algorithms, shellability
Published in RUP: 18.10.2021; Views: 3942; Downloads: 26
URL Link to full text
Search done in 0 sec.
Back to top
Logos of partners University of Maribor University of Ljubljana University of Primorska University of Nova Gorica