5monon MSN
Hard in theory, easy in practice: Why graph isomorphism algorithms seem to be so effective
Graphs are everywhere. In discrete mathematics, they are structures that show the connections between points, much like a ...
When Edsger W. Dijkstra published his algorithm in 1959, computer networks were barely a thing. The algorithm in question found the shortest path between any two nodes on a graph, with a variant ...
Coxeter theory investigates groups generated by reflections and the geometric structures arising from their actions, such as root systems and Dynkin diagrams. This body of work underpins vast areas of ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results