1. A complexitystudy of distance variants of covering and domination problems in H-free graphsMirza Krbezlija, 2021, master's thesis Found in: ključnih besedah
Summary of found: ...k-edge cover, H-free graph, polynomial-time algorithm, NP-complete problem, dichotomy theorem...
Keywords: distance-k dominating set, distance-k edge dominating set, distance-k vertex cover, distance k-edge cover, H-free graph, polynomial-time algorithm, NP-complete problem, dichotomy theorem
Published: 18.10.2021; Views: 461; Downloads: 15
 Full text (0,00 KB) |
2. |
3. |
4. |
5. Parallel ant colony optimization on the GPUMarko Grgurovič, Andrej Brodnik, 2011, published scientific conference contribution abstract Found in: ključnih besedah
Summary of found: ...ant colony optimization, parallel algorithms, traveling salesman problem, GPGPU, ...
Keywords: ant colony optimization, parallel algorithms, traveling salesman problem, GPGPU
Published: 15.10.2013; Views: 2820; Downloads: 62
Full text (0,00 KB) |
6. |
7. Informacijska podpora finančnemu kontrolinguSonja Burazin, 2009, undergraduate thesis Found in: ključnih besedah
Summary of found: ...kontroling, informatika, informacijske rešitve, informacijski problem, informacijski sistemi, finančni kontroling, uvedba informacijskih rešitev,...
Keywords: kontroling, informatika, informacijske rešitve, informacijski problem, informacijski sistemi, finančni kontroling, uvedba informacijskih rešitev
Published: 15.10.2013; Views: 2759; Downloads: 96
Full text (0,00 KB)
This document has more files! More...
|
8. A note on a geometric construction of large Cayley graps of given degree and diameterKlavdija Kutnar, István Kovács, György Kiss, János Ruff, Primož Šparl, 2008, published scientific conference contribution abstract Found in: ključnih besedah
Summary of found: ...diameter-degree problem, Cayley graph, projective space, ...
Keywords: diameter-degree problem, Cayley graph, projective space
Published: 15.10.2013; Views: 2737; Downloads: 25
Full text (0,00 KB) |
9. A note on a geometric construction of large Cayley graps of given degree and diameterKlavdija Kutnar, István Kovács, György Kiss, János Ruff, Primož Šparl, 2009, original scientific article Abstract: An infinite series and some sporadic examples of large Cayley graphs with given degree and diameter are constructed. The graphs arise from arcs, caps and other objects of finite projective spaces.
Found in: ključnih besedah
Summary of found: ...degree, diameter problem, Moore bound, finite projective spaces, ...
Keywords: degree, diameter problem, Moore bound, finite projective spaces
Published: 15.10.2013; Views: 2613; Downloads: 65
Full text (0,00 KB)
This document has more files! More...
|
10. |
