Quantitative Improvement Old Bound (Dijkstra): O (m+nlog⁡n)O (m+nlogn) New Bound: O (mlog⁡2/3n)O (mlog2/3n) For sparse graphs where mm is about O (n)O (n), this is asymptotically faster as nn grows.

Mathematics of Operations Research publishes articles concerned with mathematical and computational foundations of operations research, including optimization, mathematical and dynamic programming, ...

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.

Recent research has explored various aspects of complexity theory, including connections between graph theory and matrix spaces, the computation of determinants, and optimization problems.