The team proposed Graph-Decomposed k -NN Searching Algorithm to improve the time-efficiency of nearest nodes searching. In the research, A graph-decomposed tree is constructed from road network.

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.

A research team has developed a new technology that enables to process a large-scale graph algorithm without storing the graph in the main memory or on disks.

Then, it runs the graph algorithm on that small graph, with the algorithm treating the small graph as a portion of a larger, synthetic graph that does not exist. This method, the KAIST researchers ...

On the 19th of February 2025, M.Sc. Andreas Grigorjew defends his PhD thesis on Algorithms and Graph Structures for Splitting Network Flows, in Theory and Practice. The thesis is related to research ...