Results 41 to 50 of about 3,015 (169)

A Comparative Study of Subgraph Matching Isomorphic Methods in Social Networks

IEEE Access, 2018
With the fast development of social networks, more and more data has been generated. Finding useful information among these data is important. Subgraph matching is the method that can be used in social networks for social search, recommender systems, and
TingHuai Ma, Siyang Yu, Jie Cao, Yuan Tian, Abdullah Al-Dhelaan, Mznah Al-Rodhaan   +5 more
doaj   +1 more source

Deficiency and Forbidden Subgraphs of Connected, Locally-Connected Graphs

Discussiones Mathematicae Graph Theory, 2020
A graph G is locally-connected if the neighbourhood NG(v) induces a connected subgraph for each vertex v in G. For a graph G, the deficiency of G is the number of vertices unsaturated by a maximum matching, denoted by def(G). In fact, the deficiency of a
Li Xihe, Wang Ligong
doaj   +1 more source

Efficient Subgraph Matching Using GPUs [PDF]

, 2014
The explosive growth of various social networks such as Facebook, Twitter, and Instagram has brought in new needs for efficient graph algorithms. As a basic graph operation, subgraph matching is the foundation of many of these algorithms. Consequently, the efficiency of subgraph matching is very important and determines the speed of the whole data ...
Xiaojie Lin, Rui Zhang, Zeyi Wen, Hongzhi Wang, Jianzhong Qi   +4 more
openaire   +1 more source

SkelPy: A graphic user interface–based approach for skeletonizing fungal networks

Applications in Plant Sciences, EarlyView.
Abstract Premise Traditional methods to quantify mycelial growth rely on destructive sampling to quantify biomass. Moreover, these approaches limit continuous observation and require a sufficient mass to measure. Recent work examines hyphal network traits by reconstructing the hyphal network from spatial coordinates via images, providing information ...
Melanie Madrigal, Aaron J. Moseley, Jenna C. Moseley, Jordan A. Dowell   +3 more
wiley   +1 more source

Enhancing GNN Explanations for Malware Detection with Dual Subgraph Matching

Machine Learning and Knowledge Extraction
The increasing sophistication of malware has challenged the effectiveness of conventional detection techniques, motivating the adoption of Graph Neural Networks (GNNs) for their ability to model the structural and semantic information embedded in control
Hossein Shokouhinejad, Roozbeh Razavi-Far, Griffin Higgins, Ali A. Ghorbani   +3 more
doaj   +1 more source

Connections between the matching and chromatic polynomials

International Journal of Mathematics and Mathematical Sciences, 1992
The main results established are (i) a connection between the matching and chromatic polynomials and (ii) a formula for the matching polynomial of a general complement of a subgraph of a graph.
E. J. Farrell, Earl Glen Whitehead
doaj   +1 more source

Impact Vertices-Aware Diffusion Walk Algorithm for Efficient Subgraph Pattern Matching in Massive Graphs

IEEE Access, 2019
Subgraph pattern matching is a basic building block for many applications. Where to commence the pattern matching task and how to proceed are fundamental issues in massive graphs.
Lihua Ai, Lakshmish Ramaswamy, Siwei Luo
doaj   +1 more source

Spanning eulerian subgraphs and matchings

Discrete Mathematics, 1989
For a graph G and a connected subgraph H, the contraction G/H is obtained from G by contracting the vertices of H to a single vertex and deleting the arising loops, of course, with preserving all edges between H and G-H inclusive of multiple edges which may arise.
openaire   +2 more sources

Efficient Subgraph Similarity All-Matching [PDF]

, 2012
Being a fundamental problem in managing graph data, subgraph exact all-matching enumerates all isomorphic matches of a query graph q in a large data graph G. The existing techniques focus on pruning non-promising data graph vertices against q. However, the reduction and sharing of intermediate matches have not received adequate attention.
Gaoping Zhu, Ke Zhu, Wenjie Zhang, Xuemin Lin, Chuan Xiao   +4 more
openaire   +1 more source

Efficient subgraph matching on billion node graphs [PDF]

Proceedings of the VLDB Endowment, 2012
The ability to handle large scale graph data is crucial to an increasing number of applications. Much work has been dedicated to supporting basic graph operations such as subgraph matching, reachability, regular expression matching, etc. In many cases, graph indices are employed to speed up query processing. Typically, most indices require either super-
Sun, Zhao, Wang, Hongzhi, Wang, Haixun, Shao, Bin, Li, Jianzhong   +4 more
openaire   +2 more sources