Results 211 to 220 of about 21,959 (221)
Some of the next articles are maybe not open access.
SLF: A passive parallelization of subgraph isomorphism
Information Sciences, 2023zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Liang, Wenle +2 more
openaire +2 more sources
k-Subgraph Isomorphism on AC0 Circuits
computational complexity, 2009Recently, 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
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 +1 more source
Edge-Packing by Isomorphic Subgraphs
2013Maximum G Edge-Packing (EPackG) is the problem of finding the maximum number of edge-disjoint isomorphic copies of a fixed guest graph G in a host graph H. This paper investigates the computational complexity of edge-packing for planar guests and planar hosts.
Vergara, John Paul C., Heath, Lenwood S.
openaire +2 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
Graphs with Isomorphic Subgraphs
Journal of the London Mathematical Society, 1972Radjavi, Heydar, Rosenthal, Peter
openaire +1 more source
Edge-packing by isomorphic subgraphs
2014Maximum G Edge-Packing (E PackG) is the problem of finding the maximum number of edge-disjoint isomorphic copies of a fixed guest graph G in a host graph H. The problem is primarily considered for several guest graphs (stars, paths and cycles) and host graphs (arbitrary graphs, planar graphs and trees).
openaire +1 more source