Results 151 to 160 of about 23,139 (195)

An Efficient Index-Based Algorithm for Exact Subgraph Isomorphism on Bipartite Graphs

Scientific Research Communications
Graphs are widely used to represent various real-world networks, but their non-linear nature and size increase pose challenges for efficient analysis. The subgraph isomorphism problem, which involves identifying subgraphs that are isomorphic to a query ...
Mehmet Burak Koca, F. E. Sevilgen
semanticscholar   +1 more source

A New QUBO Objective Function for Solving the Maximum Common Subgraph Isomorphism Problem Via Quantum Annealing

SN Computer Science, 2021
Nan Huang, D. Roje
semanticscholar   +1 more source

Molecular Docking via Weighted Subgraph Isomorphism on Quantum Annealers

Quantum Science and Technology
Molecular docking is an essential step in the drug discovery process involving the detection of three-dimensional poses of a ligand inside the active site of the protein.
Emanuele Triuzzi, R. Mengoni, Domenico Bonanni, Daniele Ottaviani, A. Beccari, Gianluca Palermo   +5 more
semanticscholar   +1 more source

Efficient Exploration of Cyber-Physical System Architectures Using Contracts and Subgraph Isomorphism

Design, Automation and Test in Europe
We present ContrArc, a methodology for the exploration of cyber-physical system architectures aiming to minimize a cost function while adhering to a set of heterogeneous constraints.
Yifeng Xiao, Chanwook Oh, Michele Lora, Pierluigi Nuzzo   +3 more
semanticscholar   +1 more source

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

2019 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.
Masashi Tawada, Nozomu Togawa, Junya Arai, Natsuhito Yoshimura, Hiroyuki Uchiyama, Shu Tanaka, Satoshi Yagi   +6 more
openaire   +2 more sources

A Distributed Framework for Subgraph Isomorphism Leveraging CPU and GPU Heterogeneous Computing

International Conference on Parallel Processing
Subgraph isomorphism enumerates all embeddings in a data graph that are identical to a query graph. It is a well-known NP-hard problem widely used in various domains, such as bioinformatics, chem-informatics, and social network analysis. Recent works are
Chen Chen, Li Shen, Yingwen Chen
semanticscholar   +1 more source

Improved Dynamics for the Maximum Common Subgraph Problem

arXiv.org
The Maximum Common Subgraph (MCS) problem plays a crucial role across various domains, bridging theoretical exploration and practical applications in fields like bioinformatics and social network analysis.
Davide Guidobene, Guido Cera
semanticscholar   +1 more source

Performance Comparison of Adaptive Matching Orders for the Subgraph Isomorphism Problem

, 2020
Seongi Hong, Geonmo Gu, Hyunjoon Kim, Kunsoo Park   +3 more
semanticscholar   +1 more source

Navigating financial toxicity in patients with cancer: A multidisciplinary management approach

Ca-A Cancer Journal for Clinicians, 2022
Grace Li Smith, Matthew P Banegas, Chiara Acquati, Lmsw   +2 more
exaly  

Detecting dynamic patterns in dynamic graphs using subgraph isomorphism

Pattern Analysis and Applications, 2023
K. S. Oberoi, G. D. Mondo, Benoit Gaüzère, Y. Dupuis, P. Vasseur   +4 more
semanticscholar   +1 more source