TU Wien:Algorithmics VU (Raidl)/Helpful links for exercises
Zur Navigation springen
Zur Suche springen
- Algorithm for an Euclidean Graph, with α > 1 is like a weighted A* algorithm: https://en.wikipedia.org/wiki/A*_search_algorithm
- Non-planarity of Bipartite Graph K3,3: https://courses.engr.illinois.edu/cs173/fa2009/lectures/lect_40.pdf