An efficient and refined minimum spanning tree approach for large water distribution system

Abstract

For the past several years, large graph mining applications have been used for a wide range of analyses. One such application is a water distribution system (WDS). WDSs are networked with both topological and behavioural complexity since it comprises of a large number of pipes and junctions. Therefore, it becomes highly expensive to design such large WDSs. Hence, in this paper, we suggest to construct a reduced WDS network with minimum cost by applying a minimum spanning tree (MST) approach. However, it becomes difficult to apply traditional MST algorithms to large graphs because they have a time complexity of O(N2log N). Therefore the authors propose a divide-and-conquer mechanism for finding an approximate MST. The proposed approach shows the novelty of the algorithm by reducing the time complexity to O(N1.5log N). Experimental results show that the proposed approach had performed well and fit the expected results for both synthetic and real-world data.