Re:Ask HN: Are new graph algorithms still being devised?
by jaxk on Saturday May 29, 2021 @06:51AM
(#27324380)
Yeah I get that you have to tweak canonical algorithms to suit the current problem but I am thinking more about developing algo for open problems or improving the performance at research level. Also, are algorithms beyond basic ones like shortest path, a* search and network flow are ever needed in real world situations? They all seem done and dusted pretty much.
[ Parent
| on HN ]
Re:Ask HN: Are new graph algorithms still being devised?
by duped on Saturday May 29, 2021 @10:28AM
(#27325457)
Yes graph algorithms are actively researched. You can browse arxiv.org and see plenty of recent submissions: https://arxiv.org/search/?query=Graph&source=header&searchty...
For applications, compilers need graph coloring. Task schedulers need graph cuts. Since these are NP complete there is plenty of room for research on specific implementations with various heuristics.