Results 31 to 40 of about 102,063 (249)
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 +4 more sources
Infinite limits and folding [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 We study infinite limits of graphs generated by the duplication model for biological networks. We prove that with probability 1, the sole nontrivial connected component of the limits is unique up to isomorphism. We describe certain infinite deterministic
Anthony Bonato, Jeannette Janssen
doaj +1 more source
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
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
A coding method for efficient subgraph querying on vertex- and edge-labeled graphs. [PDF]
PLoS ONE, 2014 Labeled graphs are widely used to model complex data in many domains, so subgraph querying has been attracting more and more attention from researchers around the world.
Lei Zhu +5 more
doaj +1 more source
cuTS: Scaling Subgraph Isomorphism on Distributed Multi-GPU Systems Using Trie Based Data Structure
International Conference for High Performance Computing, Networking, Storage and Analysis, 2021 Subgraph isomorphism is a pattern-matching algorithm widely used in many domains such as chem-informatics, bioinformatics, databases, and social network analysis. It is computationally expensive and is a proven NP-hard problem. The massive parallelism in
Lizhi Xiang +4 more
semanticscholar +1 more source
Groups for which the noncommuting graph is a split graph [PDF]
International Journal of Group Theory, 2017 The noncommuting graph $nabla (G)$ of a group $G$ is a simple graph whose vertex set is the set of noncentral elements of $G$ and the edges of which are the ones connecting two noncommuting elements. We determine here, up to isomorphism, the structure of
Marzieh Akbari, Alireza Moghaddamfar
doaj +1 more source
Large Graph Sampling Algorithm for Frequent Subgraph Mining
IEEE Access, 2021 Large graph networks frequently appear in the latest applications. Their graph structures are very large, and the interaction among the vertices makes it difficult to split the structures into separate multiple structures, thus increasing the difficulty ...
Tianyu Zheng, Li Wang
doaj +1 more source
SEARCH-TREE SIZE ESTIMATION FOR THE SUBGRAPH ISOMORPHISM PROBLEM [PDF]
Acta Electrotechnica et Informatica, 2019 This article addresses the problem of finding patterns in graphs. This is formally defined as the subgraph isomorphism problem and is one of the core problems in theoretical computer science. We consider the counting variation of this problem.
Uroš Čibej, Jurij MIHELIČ
doaj +1 more source
Recursive-Parallel Algorithm for Solving the Graph-Subgraph Isomorphism Problem
Моделирование и анализ информационных систем, 2022 The paper proposes a parallel algorithm for solving the Graph-Subgraph Isomorphism Problem and makes an experimental study of its efficiency. The problem is one of the most famous NP-complete problems.
Vladimir V. Vasilchikov
doaj +1 more source