Results 231 to 240 of about 101,745 (269)
Some of the next articles are maybe not open access.
An Efficient Index-Based Algorithm for Exact Subgraph Isomorphism on Bipartite Graphs
Scientific Research CommunicationsGraphs are widely used to represent various real-world networks, but their non-linear nature and size increase pose challenges for efficient analysis. The subgraph isomorphism problem, which involves identifying subgraphs that are isomorphic to a query ...
Mehmet Burak Koca, F. E. Sevilgen
semanticscholar +1 more source
On the AC0 Complexity of Subgraph Isomorphism
2014 IEEE 55th Annual Symposium on Foundations of Computer Science, 2014Let P be a fixed graph (hereafter called a "pattern"), and let Subgraph(P) denote the problem of deciding whether a given graph G contains a subgraph isomorphic to P. We are interested in AC0-complexity of this problem, determined by the smallest possible exponent C(P) for which Subgraph(P) possesses bounded-depth circuits of size nC(P)+o(1). Motivated
Yuan Li +2 more
openaire +3 more sources
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
Heuristic sampling for the subgraph isomorphism problem [PDF]
2017 IEEE 14th International Scientific Conference on Informatics, 2017 Subgraph isomorphism is one of the fundamental search problems in computer science. In this article we consider the counting variation of this problem. The task is to count all instances of the pattern G occurring in a (usually larger) graph H. All algorithms for this problem use a variation of backtracking. Most commonly they assign one vertex of G to
Uros Cibej, Jurij Mihelič
openaire +1 more source
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
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