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.
Connected graphs of fixed order and size with minimal index
Francesco Belardo, Enzo M. Li Marzi, Slobodan Simić, 2004, original scientific article

Found in: ključnih besedah
Summary of found: ...largest eingenvalue, spectral radius, graph index, nested split graphs, ...
Keywords: spekter grafa, največja lastna vrednost, spektralni radij, indeks grafa, graph spectrum, largest eingenvalue, spectral radius, graph index, nested split graphs
Published: 15.10.2015; Views: 942; Downloads: 19
URL Full text (0,00 KB)

2.
Vector connectivity in graphs
Ferdinando Cicalese, Martin Milanič, Pinar Heggernes, Endre Boros, Pim Van 't Hof, Romeo Rizzi, 2014, published scientific conference contribution abstract (invited lecture)

Found in: ključnih besedah
Summary of found: ...approximation algorithms, poynomial time algorithms, NP-hard problem, split graphs, cographs, trees, ...
Keywords: vektorska povezanost, aproksimacijski algoritmi, polinomski algoritmi, NP-poln problem, razcepljeni grafi, kografi, drevesa, vector connectivity, approximation algorithms, poynomial time algorithms, NP-hard problem, split graphs, cographs, trees
Published: 15.10.2015; Views: 1240; Downloads: 88
URL Full text (0,00 KB)
This document has more files! More...

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