Results 141 to 150 of about 564 (166)
Predicting the Conversion From Mild Cognitive Impairment to Alzheimer's Disease Using Graph Frequency Bands and Functional Connectivity-based Features. [PDF]
Basic Clin NeurosciZamani J, Talesh Jafadideh A.
europepmc +1 more source
In silico methods for drug-target interaction prediction. [PDF]
Cell Rep MethodsRu X, Xu L, Han W, Zou Q.
europepmc +1 more source
Data augmentation in a triple transformer loop retrosynthesis model.
Digit DiscovGrandjean Y, Kreutter D, Reymond JL.
europepmc +1 more source
Generative inpainting of incomplete Euclidean distance matrices of trajectories generated by a fractional Brownian motion. [PDF]
Sci RepLobashev A, Guskov D, Polovnikov K.
europepmc +1 more source
Parallel subgraph listing in a large-scale graph
Proceedings of the 2014 ACM SIGMOD International Conference on Management of Data, 2014 Subgraph listing is a fundamental operation to many graph and network analyses. The problem itself is computationally expensive and is well-studied in centralized processing algorithms. However, the centralized solutions cannot scale well to large graphs. Recently, several parallel approaches are introduced to handle the large graphs.
Yingxia Shao, Bin Cui
exaly +3 more sources
Parallel Clique-Like Subgraph Counting and Listing
Lecture Notes in Computer Science, 2019 Cliques and clique-like subgraphs (e.g., quasi-cliques) are important dense structures whose counting or listing are essential in applications like complex network analysis and community detection. These problems are usually solved by divide and conquer, where a task over a big graph can be recursively divided into subtasks over smaller subgraphs whose
Da Yan, Shuigeng Zhou, Guimu Guo
exaly +3 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Arboricity and Subgraph Listing Algorithms
SIAM Journal on Computing, 1985A strategy of edge-searching in a graph, useful to subgraph listing problems, is introduced. It gives 4 algorithms (requiring linear space) for listing all triangles and quadrangles in G in O(a(G)m) time (for planar graphs both run in linear time), all subgraphs of order 1 in \(O(\ell a(G)^{\ell -2})\) time and all cliques in O(a(G)m) time per clique ...
Norishige Chiba, Takao Nishizeki
exaly +3 more sources
From Stars to Diamonds: Counting and Listing Almost Complete Subgraphs in Large Networks
The Computer Journal, 2023 Abstract Listing dense subgraphs is a fundamental task with a variety of network analytics applications. A lot of research has been done focusing on $k$-cliques, i.e. complete subgraphs on $k$ nodes. However, requiring complete connectivity between the nodes of a subgraph may be too restrictive in many real applications.
Irene Finocchi +2 more
openaire +3 more sources
Listing Acyclic Subgraphs and Subgraphs of Bounded Girth in Directed Graphs
, 2017 The girth of a directed graph is the length of its shortest directed cycle. We consider the problem of generating all subgraphs of girth at least g in a directed graph G with n vertices and m edges. This generalizes the problem of generating acyclic subgraphs (i.e., with no directed cycle), that correspond to the subgraphs of girth at least \(n+1 ...
Alessio Conte +3 more
openaire +2 more sources