Results 71 to 80 of about 27,298 (312)
Topology‐Aware Deep Learning on Higher‐Order Structures for Drug Response Prediction
Advanced Science, EarlyView.We present TopDr, a topology‐aware deep learning framework that encodes both drugs and cell lines as multiscale simplicial complexes, capturing interactions at the 0‐, 1‐, and 2‐simplex levels. By jointly integrating local higher‐order neighborhoods and global topological structures, TopDr generates enriched representations for sensitivity prediction ...
Cong Shen +3 more
wiley +1 more source
Complex Network Filtering and Compression Algorithm Based on Triangle-Subgraph
Discrete Dynamics in Nature and Society, 2020 Compressing the data of a complex network is important for visualization. Based on the triangle-subgraph structure in complex networks, complex network filtering compression algorithm based on the triangle-subgraph is proposed.
Shuxia Ren, Tao Wu, Shubo Zhang
doaj +1 more source
Multi-Query Optimization for Subgraph Isomorphism Search
, 2016 Existing work on subgraph isomorphism search mainly focuses on a-query-at-a-time approaches: Optimizing and answering each query separately. When multiple queries arrive at the same time, sequential processing is not always the most efficient.
Ren, Xuguang, Wang, Junhu
core +1 more source
Advanced Science, EarlyView.This review explores the convergence of artificial intelligence technologies in modeling drug–drug and drug–target interactions. By evaluating advanced feature engineering, architectural innovations, and learning paradigms reveals shared evolutionary trends and critical challenges, such as cold‐start settings and shortcut learning.
Xin Sun, Tong Wang
wiley +1 more source
On Certain Types of Neutrosophic Fuzzy Graphs
Pan-American Journal of Mathematics, 2022 In this paper, we introduce some types of NF graphs and operations. Also we define the partial NF subgraph, spanning NF subgraph, strong degree of the vertex, total strong degree of the vertex and its properties are included.
Alias B. Khalaf, Prithivirajan Padma
doaj +1 more source
An Algorithm for Subgraph Isomorphism [PDF]
Journal of the ACM, 1976 Subgraph isomorphism can be determined by means of a brute-force tree-search enumeration procedure. In this paper a new algorithm is introduced that attains efficiency by inferentially eliminating successor nodes in the tree search. To assess the time actually taken by the new algorithm, subgraph isomorphism, clique detection, graph isomorphism, and ...
openaire +2 more sources
Maximum induced subgraph of a recursive circulant
, 2005 The recursive circulant RC(2(n), 4) enjoys several attractive topological properties. Let max_epsilon(G) (m) denote the maximum number of edges in a subgraph of graph G induced by m nodes. In this paper, we show that max_epsilon(RC(2n,4))(m) = Sigma(i)(r)
Megson, G. M. +5 more
core +1 more source
Updatable Closed‐Form Evaluation of Arbitrarily Complex Multiport Network Connections
Advanced Electronic Materials, EarlyView.The inverse design of electrically large wave devices often uses reduced‐order multiport models with discrete optimization, requiring many evaluations of complex interconnections between subsystems that differ only in a few blocks. This paper introduces a closed‐form framework enabling efficient Woodbury low‐rank updates of related, previous ...
Hugo Prod'homme, Philipp del Hougne
wiley +1 more source
Forbidden subgraph decomposition
Discrete Mathematics, 2002 no ...
Rusu, Irena, Spinrad, Jeremy P.
openaire +2 more sources
Random Structures & Algorithms, 2023 AbstractLet be a ‐regular graph on vertices. Frieze, Gould, Karoński, and Pfender began the study of the following random spanning subgraph model . Assign independently to each vertex of a uniform random number , and an edge of is an edge of if and only if . Addressing a problem of Alon and Wei, we prove that if , then with high probability, for
Jacob Fox, Sammy Luo, Huy Tuan Pham
openaire +3 more sources