Results 101 to 110 of about 16,183 (155)

Computational Pipeline for Accelerating the Design of Glycomimetics. [PDF]

open access: yesJ Chem Inf Model
Xiao Y   +9 more
europepmc   +1 more source

Twisted Ways to Find Plane Structures in Simple Drawings of Complete Graphs. [PDF]

open access: yesDiscrete Comput Geom
Aichholzer O   +4 more
europepmc   +1 more source

Efficient Ising Model Mapping for Induced Subgraph Isomorphism Problems Using Ising Machines

open access: closed2019 IEEE 9th International Conference on Consumer Electronics (ICCE-Berlin), 2019
Ising machines have attracted attention as they are expected to solve combinatorial optimization problems at high speed with Ising models corresponding to those problems. An induced subgraph isomorphism problem is one of the decision problems, which determines whether a specific graph structure is included in a whole graph or not.
Natsuhito Yoshimura   +6 more
semanticscholar   +3 more sources
Some of the next articles are maybe not open access.

Related searches:

Efficient Streaming Subgraph Isomorphism with Graph Neural Networks

Proceedings of the VLDB Endowment, 2021
Queries to detect isomorphic subgraphs are important in graph-based data management. While the problem of subgraph isomorphism search has received considerable attention for the static setting of a single query, or a batch thereof, existing approaches do
Chi Thang Duong   +5 more
semanticscholar   +1 more source

Efficient Implementation of Color Coding Algorithm for Subgraph Isomorphism Problem

Analysis of Experimental Algorithms - Special Event, 2019
We consider the subgraph isomorphism problem where, given two graphs G (source graph) and F (pattern graph), one is to decide whether there is a (not necessarily induced) subgraph of G isomorphic to F.
J. Malík, Ondřej Suchý, T. Valla
semanticscholar   +1 more source

Home - About - Disclaimer - Privacy