News
Abstract: Interest in high performance analytics for dynamic (constantly evolving) graphs has been on the rise in the last decade, especially due to the prevalence and rapid growth of social networks ...
Surprisingly, there is a lack of study on scaling out graph data structures to represent sparse dynamic graphs in a commodity cluster, and even the latest work [1] based upon the most common in-memory ...
In this paper, a data-driven power flow calculation method is proposed to take topological changes into account. Based on initial loop data, we employ an undirected-graph delooping-backtracking ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results