The best way to conference proceedings by Francis Academic Press

Web of Proceedings - Francis Academic Press
Web of Proceedings - Francis Academic Press

The Algorithm of Heavy Path Decomposition Based on Segment Tree

Download as PDF

DOI: 10.25236/iwmecs.2020.008

Author(s)

Jinpeng Xu, Weixing Zhang

Corresponding Author

Jinpeng Xu

Abstract

The time complexity or space complexity of the problem between any two nodes on the classic tree is high, and it is not suitable for the situation where modification and query coexist. The solution in this paper is to discuss a new algorithm- Heavy Path Decomposition, which has good time complexity and wide applicability.

Keywords

Heavy Path Decomposition, Segment Tree, data structure, algorithm