The new algorithm checks planarity in a number of steps proportional to the cube of the logarithm of the number of nodes in the graph — an exponential improvement. Holm and Rotenberg, a computer ...

Professor tackles graph mining challenges with new algorithm. ScienceDaily . Retrieved July 12, 2025 from www.sciencedaily.com / releases / 2024 / 10 / 241018162554.htm ...

Refining with colors. Mathematicians have developed various strategies to compare graphs. Since the 1970s, algorithms have been able to test graph isomorphism, but in exponential time.

Graph-decomposed k-NN searching algorithm on road network. Higher Education Press . Journal Frontiers of Computer Science DOI 10.1007/s11704-023-3626-3 ...

Since the 1970s, algorithms have been able to test graph isomorphism, but in exponential time. This means that the increasing complexity of the graphs increased the algorithm's running time ...