Explore XPeng (NYSE:XPEV), smart EV technologies, AI development, overseas expansion, manufacturing operations, and industry ...
Abstract: Structural controllability of complex networks has been an attractive research area, and Minimum Inputs Theorem was proposed to identify the minimum driver nodes for complex networks with ...
Abstract: There is a trend that many applications are deployed among multiple public or private clouds. Due to the data asset protection and network communication cost, it is not feasible to gather ...
import _nx_parallel as nxp d = nxp.get_funcs_info() # temporarily add `from .update_get_info import *` to _nx_parallel/__init__.py for func in d: print(f"- [{func ...
This repository contains code for our SPAA paper "Theoretically Efficient Parallel Graph Algorithms Can Be Fast and Scalable" (SPAA'18). It includes implementations of the following parallel graph ...
Finding bipartite matchings is one of the oldest and most well-studied problems in computer science. This problem comes up in many guises, such as when matching donors to recipients for organ ...
You are free to share (copy and redistribute) this article in any medium or format within the parameters below: Creative Commons (CC): This is a Creative Commons license. Attribution (BY): Credit must ...
Assessing power-law cross-correlations between a pair – or among a set – of processes is of great significance in diverse fields of analyses ranging from neuroscience to financial markets. In most ...
In this paper, we present two divide-and-conquer algorithms for clustering large graphs. Both algorithms apply a base algorithm on several small subgraphs and then use these individual local ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results