Results 151 to 160 of about 55,019 (192)
Neural subgraph counting on stream graphs via localized updates and monotonic learning. [PDF]
PLoS OneXie Z, Hou W, Wu F, Xu H.
europepmc +1 more source
On the minimum number of non-monochromatic simplices for Sperner labelings of a regular triangulation. [PDF]
PLoS OneCalvo Pascual LÁ +4 more
europepmc +1 more source
HKD-MGIN: a physics informed graph neural network using heat kernel diffusion for mapping adolescent functional brain connectivity. [PDF]
Mach Learn Comput Sci EngPatel B, Habeeb Z.
europepmc +1 more source
Globalization of Perturbative Chern-Simons Theory on the Moduli Space of Flat Connections in the BV Formalism. [PDF]
Commun Math PhysMnev P, Wernli K.
europepmc +1 more source
Subgraph isomorphism in graph classes [PDF]
Discrete Mathematics, 2012 We investigate the computational complexity of the following restricted variant of Subgraph Isomorphism: given a pair of connected graphs G=(VG,EG) and H=(VH,EH), determine if H is isomorphic to a spanning subgraph of G.
Shuji Kijima, Yota Otachi, Takeaki Uno
exaly +5 more sources
Multi-query optimization for subgraph isomorphism search
Proceedings of the VLDB Endowment, 2016 Existing work on subgraph isomorphism search mainly focuses on a-query-at-a-time approaches: Optimizing and answering each query separately. When multiple queries arrive at the same time, sequential processing is not always the most efficient.
Junhu Wang, Xuguang Ren
exaly +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
SLF: A passive parallelization of subgraph isomorphism
Information Sciences, 2023zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mengting Yuan, Wenyong Dong
exaly +4 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.
exaly +2 more sources
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