Results 31 to 40 of about 101,745 (269)
DotMotif: An open-source tool for connectome subgraph isomorphism search and graph queries
Scientific Reports, 2020 Recent advances in neuroscience have enabled the exploration of brain structure at the level of individual synaptic connections. These connectomics datasets continue to grow in size and complexity; methods to search for and identify interesting graph ...
Jordan Matelsky +6 more
openalex +2 more sources
Subgraph Isomorphism in Planar Graphs and Related Problems [PDF]
Journal of Graph Algorithms and Applications, 2002 27 pages, 6 figures. A preliminary version of this paper appeared at the 6th ACM-SIAM Symp.
David Eppstein
openalex +6 more sources
SEGCN: a subgraph encoding based graph convolutional network model for social bot detection [PDF]
Scientific ReportsMessage passing neural networks such as graph convolutional networks (GCN) can jointly consider various types of features for social bot detection. However, the expressive power of GCN is upper-bounded by the 1st-order Weisfeiler–Leman isomorphism test ...
Feng Liu +5 more
doaj +2 more sources
Improving Graph Neural Network Expressivity via Subgraph Isomorphism Counting [PDF]
IEEE Transactions on Pattern Analysis and Machine Intelligence, 2020 While Graph Neural Networks (GNNs) have achieved remarkable results in a variety of applications, recent studies exposed important shortcomings in their ability to capture the structure of the underlying graph. It has been shown that the expressive power
Giorgos Bouritsas +3 more
semanticscholar +1 more source
Graph Convolutional Networks with Dual Message Passing for Subgraph Isomorphism Counting and Matching [PDF]
AAAI Conference on Artificial Intelligence, 2021 Graph neural networks (GNNs) and message passing neural networks (MPNNs) have been proven to be expressive for subgraph structures in many applications.
Xin Liu, Yangqiu Song
semanticscholar +1 more source
PathLAD+: An Improved Exact Algorithm for Subgraph Isomorphism Problem
International Joint Conference on Artificial Intelligence, 2023 The subgraph isomorphism problem (SIP) is a challenging problem with wide practical applications. In the last decade, despite being a theoretical hard problem, researchers design various algorithms for solving SIP.
Yiyuan Wang +3 more
semanticscholar +1 more source
On the number of non-isomorphic subgraphs [PDF]
Israel Journal of Mathematics, 1994 Let K be the family of graphs on omega_1 without cliques or independent subsets of size omega_1 . We prove that: 1) it is consistent with CH that every G in K has 2^{omega_1} many pairwise non-isomorphic subgraphs, 2) the following proposition holds in L: (*) there is a G in K such that for each partition (A,B) of omega_1 either G cong G[A] or G cong G[
Lajos Soukup, Saharon Shelah
openaire +3 more sources
A Zero Knowledge Authentication Protocol Based on Novel Heuristic Algorithm of Dense Induced Subgraphs Isomorphism [PDF]
Engineering and Technology Journal, 2015 Graphs provide an useful mathematical tool for modeling various real world phenomena. Dense graphs arise in many places of interest, for instance the internet and social networks to name just two. The density of a graph should be a real number reflecting
N. M. G. Al-Saidi +2 more
doaj +1 more source
Temporal subgraph isomorphism [PDF]
Proceedings of the 2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, 2013 Temporal information is increasingly available with network data sets. This information can expose underlying processes in the data via sequences of link activations. Examples range from the propagation of ideas through a scientific collaboration network, to the spread of disease via contacts between infected and susceptible individuals.
Ursula Redmond, Pádraig Cunningham
openaire +2 more sources
Learning with Small Data: Subgraph Counting Queries
Data Science and Engineering, 2023 Deep Learning (DL) has been widely used in many applications, and its success is achieved with large training data. A key issue is how to provide a DL solution when there is no large training data to learn initially.
Kangfei Zhao +3 more
doaj +1 more source