Privacy-Preserving Multi-User Graph Intersection Scheme for Wireless Communications in Cloud-Assisted Internet of Things. [PDF]
Yang S.
europepmc +1 more source
A Note on the Subgraph Isomorphism Problem
identifier:oai:t2r2.star.titech.ac.jp ...
openaire
A dynamic programming algorithm for generating chemical isomers based on frequency vectors. [PDF]
Ido R +4 more
europepmc +1 more source
SynTemp: Efficient Extraction of Graph-Based Reaction Rules from Large-Scale Reaction Databases. [PDF]
Phan TL +8 more
europepmc +1 more source
GADIFF: a transferable graph attention diffusion model for generating molecular conformations. [PDF]
Wang D, Dong X, Zhang X, Hu L.
europepmc +1 more source
Problem izomorfizma podgrafov ravninskih grafov
In the subgraph isomorphism problem two graphs G and H are given as input. We must determine whether G contains a subgraph isomorphic to H. In general, the problem is NP-complete. In this thesis we present a linear algorithm for the subgraph isomorphism problem in planar graphs. The first section describes the basic concepts and definitions. The second
openaire +1 more source
k-Clique counting on large scale-graphs: a survey. [PDF]
Çalmaz B, Ergenç Bostanoğlu B.
europepmc +1 more source
On the Parameterized Complexity of Compact Set Packing. [PDF]
Gadekar A.
europepmc +1 more source
Discovering subnetworks in SBML models. [PDF]
Hellerstein JL +5 more
europepmc +1 more source
Construction of knowledge constraints: a case study of 3D structural modeling. [PDF]
Lu C, Xu X, Zhang B.
europepmc +1 more source

