Results 21 to 30 of about 21,959 (221)

Static graph challenge: Subgraph isomorphism [PDF]

2017 IEEE High Performance Extreme Computing Conference (HPEC), 2017
The rise of graph analytic systems has created a need for ways to measure and compare the capabilities of these systems. Graph analytics present unique scalability difficulties. The machine learning, high performance computing, and visual analytics communities have wrestled with these difficulties for decades and developed methodologies for creating ...
Samsi, Siddharth, Gadepally, Vijay, Hurley, Michael, Jones, Michael, Kao, Edward, Mohindra, Sanjeev, Monticciolo, Paul, Reuther, Albert, Smith, Steven, Song, William, Staheli, Diane, Kepner, Jeremy   +11 more
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, Zongyan He, Jeffrey Xu Yu, Yu Rong   +3 more
doaj   +1 more source

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, Qinbao Song, Yuchen Guo, Lei Du, Xiaoyan Zhu, Guangtao Wang   +5 more
doaj   +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

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

Pattern matching and pattern discovery algorithms for protein topologies [PDF]

, 2001
We describe algorithms for pattern matching and pattern learning in TOPS diagrams (formal descriptions of protein topologies). These problems can be reduced to checking for subgraph isomorphism and finding maximal common subgraphs in a restricted ...
C. Bron, C.A. Orengo, C.A. Orengo, D. Gilbert, D.R. Westhead, D.R. Westhead, H.M. Berman, I. Koch, J.J. McGregor, J.R. Ullmann, K. Hofmann, K. Zhang, L. Holm, P.A. Evans, T.P.J. Flores   +14 more
core   +1 more source

Graph theoretic methods for the analysis of structural relationships in biological macromolecules [PDF]

, 2005
Subgraph isomorphism and maximum common subgraph isomorphism algorithms from graph theory provide an effective and an efficient way of identifying structural relationships between biological macromolecules.
Altschul, Artymiuk, Artymiuk, Artymiuk, Artymiuk, Artymiuk, Barnard, Baxevanis, Benning, Berman, Bernstein, Brint, Brint, Bron, Bruno, Bryant, Crandell, Dean, Diestel, Doubet, Fan, Feizi, Figueras, Flores, Gardiner, Gati, Good, Gray, Groves, Gruer, Gund, Hagadone, Harrison, Holden, Hutchinson, Jasanoff, Johnson, Kanna, Klausner, Kleywegt, Koch, Kraulis, Lengauer, Lesk, Martin, Martin, McGregor, Messmer, Mitchell, Ollis, Pickering, Ray, Raymond, Read, Salton, Samudrala, Sayle, Simon, Srere, Sussenguth, Tesmer, Tinoco, Trinajstic, Tsukada, Ullmann, van Rijsbergen, Willett, Willett, Willett, Willett, Williams, Wilson, Zhang   +72 more
core   +3 more sources

Research on the Top-Down Parsing Method for Context-Sensitive Graph Grammars. [PDF]

PLoS ONE, 2015
The parsing problem is one of the key problems of graph grammars. The typical parsing algorithm uses the bottom-up method. The time-complexity of this method is high, and it is difficult to apply.
Yi Wang, XiaoQin Zeng, Han Ding
doaj   +1 more source

Efficient Subgraph Similarity Search on Large Probabilistic Graph Databases [PDF]

, 2012
Many studies have been conducted on seeking the efficient solution for subgraph similarity search over certain (deterministic) graphs due to its wide application in many fields, including bioinformatics, social network analysis, and Resource Description ...
Chen, Lei, Wang, Guoren, Wang, Haixun, Yuan, Ye   +3 more
core   +3 more sources