Results 61 to 70 of about 3,015 (169)
Decomposition Techniques for Subgraph Matching
, 2008 In the constraint programming framework, state-of-the-art static and dynamic decomposition techniques are hard to apply to problems with complete initial constraint graphs. For such problems, we propose a hybrid approach of these techniques in the presence of global constraints. In particular, we solve the subgraph isomorphism problem.
Zampelli, Stephane +3 more
openaire +2 more sources
Subgraph Queries by Context-free Grammars
Journal of Integrative Bioinformatics, 2008 We describe a method for querying vertex- and edge-labeled graphs using context-free grammars to specify the class of interesting paths. We introduce a novel problem, finding the connection subgraph induced by the set of matching paths between given two ...
Sevon Petteri, Eronen Lauri
doaj +1 more source
Graph-Based Node Finding in Big Complex Contextual Social Graphs
Complexity, 2020 Graph pattern matching is to find the subgraphs matching the given pattern graphs. In complex contextual social networks, considering the constraints of social contexts like the social relationships, the social trust, and the social positions, users are ...
Keshou Wu, Guanfeng Liu, Junwen Lu
doaj +1 more source
A Subgraph Retrieval Method for Complex Questions Based on Hybrid Semantics and Path Representation [PDF]
ITM Web of ConferencesCurrent subgraph retrieval methods generally fall into two categories: those that rely on semantic matching, which use only surface-level semantic information of relations and lack flexibility; and those based on personalized PageRank algorithms, which ...
Hao Jifei, Cheng Bo
doaj +1 more source
SymmPi: Exploiting Symmetry Removal for Fast Subgraph Matching
Data Science and EngineeringSymmetry, a phenomenon of self-similarity, is common in many networks, which often incurs a lot of redundant accesses and computations, even duplicate results when executing graph matching tasks. Many approaches (e.g.
Yujiang Wang +4 more
doaj +1 more source
Partial bundle adjustment for accurate three‐dimensional reconstruction
IET Computer Vision, 2019 Structure from motion aims at estimating the cameras and sparse structure of the scene globally, but the approximation biases in bundle adjustment and the propagated errors among the registered cameras and triangulated points reduce the quality of the ...
Keyang Luo +3 more
doaj +1 more source
A Maximum Resonant Set of Polyomino Graphs
Discussiones Mathematicae Graph Theory, 2016 A polyomino graph P is a connected finite subgraph of the infinite plane grid such that each finite face is surrounded by a regular square of side length one and each edge belongs to at least one square.
Zhang Heping, Zhou Xiangqian
doaj +1 more source
Maximum common subgraph: some upper bound and lower bound results
BMC Bioinformatics, 2006 Background Structure matching plays an important part in understanding the functional role of biological structures. Bioinformatics assists in this effort by reformulating this process into a problem of finding a maximum common subgraph between graphical
Jennings Steven F +2 more
doaj +1 more source
Low-Power Subgraph Isomorphism at the Edge Using FPGAs
IEEE AccessSubgraph matching is a significant problem in several fields, including like social network analysis, chemical compound search, and fraud detection. While current solutions using CPU, graphics processing units (GPUs), and data center field-programmable ...
Roberto Bosio +5 more
doaj +1 more source
MultiGraphMatch: A Subgraph Matching Algorithm for Multigraphs
ACM Transactions on Knowledge Discovery from DataSubgraph matching is the problem of finding all the occurrences of a small graph, called the query, in a larger graph, called the target. Although the problem has been widely studied in simple graphs, few solutions have been proposed for multigraphs, in which two nodes can be connected by multiple edges, each denoting a possibly different type of ...
Giovanni Micale +7 more
openaire +2 more sources