Results 81 to 90 of about 55,019 (192)

Subgraph Query for Building Service-Based Systems

IEEE Access, 2019
Given the broad applications of service-oriented architecture (SOA) in service-oriented software engineering, service-based systems (SBSs) built from existing Web services are becoming increasingly popular.
Jintao Wu, Xing Guo, Guijun Yang, Shuhui Wu, Haseeb Hassan, Jianguo Wu   +5 more
doaj   +1 more source

Understanding the Complexity of Induced Subgraph Isomorphisms [PDF]

, 2008
We study left-hand side restrictions of the induced subgraph isomorphismproblem: Fixing a class , for given graphs G and arbitrary Hwe ask for induced subgraphs of Hisomorphic to G. For the homomorphism problem this kind of restriction has been studied by Grohe and Dalmau, Kolaitis and Vardi for the decision problem and by Dalmau and ...
Yijia Chen 0001, Marc Thurley, Mark Weyer   +2 more
openaire   +1 more source

Practical Bigraphs via Subgraph Isomorphism [PDF]

, 2021
Bigraphs simultaneously model the spatial and non-spatial relationships between entities, and have been used for systems modelling in areas including biology, networking, and sensors. Temporal evolution can be modelled through a rewriting system, driven by a matching algorithm that identifies instances of bigraphs to be rewritten. The previous state-of-
Blair Archibald, Kyle Burns, Ciaran McCreesh, Michele Sevegnani   +3 more
openaire   +3 more sources

Explainable Neural Subgraph Matching With Learnable Multi-Hop Attention

IEEE Access
Subgraph matching is a challenging problem with a wide range of applications in drug discovery, social network analysis, biochemistry, and cognitive science.
Duc Q. Nguyen, Thanh Toan Nguyen, Jun Jo, Florent Poux, Shikha Anirban, Tho T. Quan   +5 more
doaj   +1 more source

AllDifferent-based filtering for subgraph isomorphism

Artificial Intelligence, 2010
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +4 more sources

FSM-BC-BSP: Frequent Subgraph Mining Algorithm Based on BC-BSP

Applied Sciences
As graph models become increasingly prevalent in the processing of scientific data, the exploration of effective methods for the mining of meaningful patterns from large-scale graphs has garnered significant research attention. This paper delves into the
Fangling Leng, Fan Li, Yubin Bao, Tiancheng Zhang, Ge Yu   +4 more
doaj   +1 more source

Fuzzy graphs and their applications in finding the best route, dominant node and influence index in a network under the hesitant bipolar-valued fuzzy environment

Complex & Intelligent Systems
This paper introduces the concept of hesitant bipolar-valued fuzzy graph (HBVFG), which captures the two opposing perspectives, namely the positive and negative opinions.
Jambi Ratna Raja, Jeong Gon Lee, Dhanraj Dhotre, Pravin Mane, Omprakash Sugdeo Rajankar, Antonios Kalampakas, Navin D. Jambhekar, D. G. Bhalke   +7 more
doaj   +1 more source

MSP: Multiple Sub-graph Query Processing using Structure-based Graph Partitioning Strategy and Map-Reduce

Journal of King Saud University: Computer and Information Sciences, 2019
In a distributed environment, the volume of graph database increases quickly because graphs emerge from several autonomous sources. Sub-graph query processing is a challenging problem in distributed environment.
Shaik Fathimabi, R.B.V. Subramanyam, D.V.L.N. Somayajulu   +2 more
doaj   +1 more source

A Convex Relaxation Bound for Subgraph Isomorphism [PDF]

International Journal of Combinatorics, 2012
In this work a convex relaxation of a subgraph isomorphism problem is proposed, which leads to a new lower bound that can provide a proof that a subgraph isomorphism between two graphs can not be found. The bound is based on a semidefinite programming relaxation of a combinatorial optimisation formulation for subgraph isomorphism and is explained in ...
openaire   +2 more sources

Experimental Evaluation of Subgraph Isomorphism Solvers [PDF]

, 2019
Subgraph Isomorphism (SI) is an NP-complete problem which is at the heart of many structural pattern recognition tasks as it involves finding a copy of a pattern graph into a target graph. In the pattern recognition community, the most well-known SI solvers are VF2, VF3, and RI.
openaire   +2 more sources