Results 161 to 170 of about 55,019 (192)
On the Variable Ordering in Subgraph Isomorphism Algorithms
IEEE/ACM Transactions on Computational Biology and Bioinformatics, 2017 Graphs are mathematical structures to model several biological data. Applications to analyze them require to apply solutions for the subgraph isomorphism problem, which is NP-complete. Here, we investigate the existing strategies to reduce the subgraph isomorphism algorithm running time with emphasis on the importance of the order with which the graph ...
Rosalba Giugno, Vincenzo Bonnici
exaly +7 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Exploiting Isomorphic Subgraphs in SAT
2021While static symmetry breaking has been explored in the SAT community for decades, only as of 2010 research has focused on exploiting the same discovered symmetry dynamically, during the run of the SAT solver, by learning extra clauses. The two methods are distinct and not compatible.
Ivrii, Alexander, Strichman, Ofer
openaire +1 more source
VF2++—An improved subgraph isomorphism algorithm
Discrete Applied Mathematics, 2018zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Peter Madarasi, Alpar Jüttner
exaly +4 more sources
Detecting subgraph isomorphism with MapReduce
The Journal of Supercomputing, 2016In recent years, the MapReduce framework has become one of the most popular parallel computing platforms for processing big data. MapReduce is used by companies such as Facebook, IBM, and Google to process or analyze massive data sets. Since the approach is frequently used for industrial solutions, the algorithms based on the MapReduce framework gained
Fehér, Péter +4 more
openaire +2 more sources
A Parallel Algorithm for Subgraph Isomorphism
2019In different application fields, such as biology, databases, social networks and so on, graphs are a widely adopted structure to represent the data. In these fields, a relevant problem is the detection and the localization of structural patterns within very large graphs; such a problem, formalized as subgraph isomorphism, has been proven to be NP ...
Vincenzo Carletti +4 more
openaire +3 more sources
A subgraph isomorphism algorithm using resolution
Pattern Recognition, 1981Abstract An efficient algorithm for subgraph isomorphism is presented. It combines tree search with relaxation by using resolution. Bitwise parallelism, which is an important factor in speed, is achieved during the resolution process even though a sequential computer is used.
T S Huang
exaly +2 more sources
A hough transform technique for subgraph isomorphism
Pattern Recognition Letters, 1983The Generalized Hough Transform is an established technique for geometric shape matching. An analogous technique is presented here for approximate solution of subgraph isomorphism problems. Its chief advantages are that it can also be used to find partial isomorphisms and that it can be readily implemented in parallel on a network of simple processors.
Simon Kasif, Azriel Rosenfeld
exaly +3 more sources
Isomorphic edge disjoint subgraphs of hypergraphs
Random Structures & Algorithms, 2016Summary: We show that any \(k\)-uniform hypergraph with \(n\) edges contains two isomorphic edge disjoint subgraphs of size \(\tilde{\Omega} (n^{2/(k+1)}) \) for \(k = 4, 5\) and \(6\). This is best possible up to a logarithmic factor due to an upper bound construction of \textit{P. Erdős} et al. [in: Combinatorics, Proc. 7th Hung.
Paul Horn, Václav Koubek, Vojtech Rödl
openaire +3 more sources
Towards a taxonomy of subgraph isomorphism algorithms
Proceedings of the Annual Conference of the South African Institute of Computer Scientists and Information Technologists, 2018The study of algorithms which solve the subgraph isomorphism problem is very important because it has many applications where data is modelled as graphs. Despite the subgraph isomorphism problem being NP-hard, research has been dedicated to proposing new algorithms which are designed to improve the shortcomings of the algorithms that have been ...
Pula Rammoko, Linda Marshall
openaire +1 more source
A Bound for Non-subgraph Isomorphism
2007In this paper we propose a new lower bound to a subgraph isomorphism problem. This bound can provide a proof that no subgraph isomorphism between two graphs can be found. The computation is based on the SDP relaxation of a - to the best of our knowledge - new combinatorial optimisation formulation for subgraph isomorphism. We consider problem instances
openaire +1 more source