Results 171 to 180 of about 102,063 (249)
The subgraph isomorphism problem
This thesis describes the problem of finding subgraph isomorphism. This is one of the most basic operations performed on graphs and is an NP-hard problem. We describe in detail the Ullmann algorithm and VF2 algorithm, the most commonly used and state-of-the art algorithms in this field, and a new algorithm called Subsea.
openaire +1 more source
Dynamic frequent subgraph mining algorithms over evolving graphs: a survey. [PDF]
Ergenç Bostanoğlu B, Abuzayed N.
europepmc +1 more source
Neural subgraph counting on stream graphs via localized updates and monotonic learning. [PDF]
Xie Z, Hou W, Wu F, Xu H.
europepmc +1 more source
The decomposition of a generalized graph into isomorphic subgraphs [PDF]
openaire +3 more sources
Orthology and near-cographs in the context of phylogenetic networks. [PDF]
Lindeberg A +3 more
europepmc +1 more source
Spatial morphoproteomic features predict disease states from tissue architectures. [PDF]
Hu T +9 more
europepmc +1 more source
Automatic Identification and Visualization of Reaction Mechanisms Contained within Direct Dynamics Simulations. [PDF]
Kobulnicky T, Boafo E, Barnes GL.
europepmc +1 more source
Solving subgraph isomorphism problems with constraint programming
Stéphane Zampelli +2 more
openalex +2 more sources
mineMS2: annotation of spectral libraries with exact fragmentation patterns. [PDF]
Delabrière A +10 more
europepmc +1 more source

