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 - 3 / 3
First pagePrevious page1Next pageLast page
1.
Planarity testing algorithms : zaključna naloga
Uroš Babić, 2025, undergraduate thesis

Keywords: graph planarity, planarity testing, Boyer–Myrvold algorithm, Kuratowski/Wagner theorem, depth-first search (DFS), lowpoint values, articulation points, biconnected components, graph embedding, graph6 format
Published in RUP: 04.10.2025; Views: 512; Downloads: 0

2.
Graphs where search methods are indistinguishable
Matjaž Krnc, Nevena Pivač, 2021, published scientific conference contribution

Keywords: graph search methods, breadth first search, depth first search
Published in RUP: 18.10.2021; Views: 3120; Downloads: 26
URL Link to full text

3.
Graphs where search methods are indistinguishable
Matjaž Krnc, Nevena Pivač, 2021, published scientific conference contribution

Keywords: graph search methods, breadth first search, depth first search
Published in RUP: 18.10.2021; Views: 4113; Downloads: 28
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