Results 231 to 240 of about 102,063 (249)
Some of the next articles are maybe not open access.
The GR3 Algorithm for Parallel Quantum Searching of Subgraph Isomorphism
International Conference on Software, Telecommunications and Computer Networks, 2021The purpose of the research presented in this paper is finding the best execution times for searching subgraph isomorphisms. For this was created the GR3 Algorithm, its design consisting of a combination of Parallel Programming and Quantum Computing. The
Radu-Iulian Gheorghica
semanticscholar +1 more source
k-Subgraph Isomorphism on AC0 Circuits [PDF]
computational complexity, 2009 Recently, Rossman [STOC '08] established a lower bound of $\omega(n^{k/4})$ on the size of constant-depth circuits for the $k$-clique function on $n$-vertex graphs, which is the first lower bound that does not depend on the depth of circuits in the exponent of $n$. He showed, in fact, a stronger statement: Suppose $f_n:\{0,1\}^{n \choose 2} \rightarrow
openaire +1 more source
SICOR: Subgraph Isomorphism Comparison of RNA Secondary Structures
IEEE/ACM Transactions on Computational Biology & Bioinformatics, 2020RNA aptamer selection during SELEX experiments builds on secondary structural diversity. Advanced structural comparison methods can focus this diversity.
Michael Schmidt +6 more
semanticscholar +1 more source
Challenging the Time Complexity of Exact Subgraph Isomorphism for Huge and Dense Graphs with VF3
IEEE Transactions on Pattern Analysis and Machine Intelligence, 2018Graph matching is essential in several fields that use structured information, such as biology, chemistry, social networks, knowledge management, document analysis and others.
Vincenzo Carletti +3 more
semanticscholar +1 more source
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 +3 more sources
Inexact subgraph isomorphism in MapReduce
Journal of Parallel and Distributed Computing, 2013Inexact subgraph matching based on type-isomorphism was introduced by Berry et al. [J. Berry, B. Hendrickson, S. Kahan, P. Konecny, Software and algorithms for graph queries on multithreaded architectures, in: Proc. IEEE International Parallel and Distributed Computing Symposium, IEEE, 2007, pp.
openaire +2 more sources
Detecting dynamic patterns in dynamic graphs using subgraph isomorphism
Pattern Analysis and Applications, 2023K. S. Oberoi +4 more
semanticscholar +1 more source
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 ...
Linda Marshall, Pula Rammoko
openaire +2 more sources
Isomorphic edge disjoint subgraphs of hypergraphs
Random Structures & Algorithms, 2016We show that any k-uniform hypergraph with n edges contains two isomorphic edge disjoint subgraphs of size for k = 4, 5 and 6. This is best possible up to a logarithmic factor due to an upper bound construction of Erdős, Pach, and Pyber who show there exist k-uniform hypergraphs with n edges and with no two edge disjoint isomorphic subgraphs with size ...
Vojtěch Rödl +2 more
openaire +1 more source
Privacy preserving subgraph isomorphism query for dynamic graph database
Journal of Network and Computer Applications, 2022Linhao Cong, Jia Yu, Xinrui Ge
semanticscholar +1 more source