1. Hamilton cycle and Hamilton path extendability of Cayley graphs on abelian groupsŠtefko Miklavič, Primož Šparl, 2012, izvirni znanstveni članek Ključne besede: graph theory, Hamilton cycle, Hamilton path, n-HC-extendable, strongly n-HP-extendable, weakly n-HP-extendable, Cayley graph, abelian group Celotno besedilo (povezava drugam) |
|
|
|
|
|
7. Relatively uniformly continuous semigroups of positive operators on vector latticesMichael Kaplin, 2020, doktorsko delo/naloga Ključne besede: vector lattices, relatively uniform convergence, relatively uniform topology, relatively uniform continuity, positive operator semigroups, strongly continuous semigroups, Hille-Yosida theorem Celotno besedilo (datoteka, 705,86 KB) |
8. Algorithms for finding the strongly connected components of directed graphsINA LANG, 2021, diplomsko delo Ključne besede: graph, strong connectivity, strongly connected, Tarjan’s algorithm, Kosaraju’s algorithm, Gabow, path-based, Blelloch, Fleischer, parallelism. Celotno besedilo (datoteka, 2,01 MB) |
|