Isomorphic Subgraph-based Problem Reduction for Resource Minimal Modulo Scheduling
2019 International Conference on ReConFigurable Computing and FPGAs (ReConFig), 2019Modulo scheduling is a powerful method to increase throughput in high-level synthesis for digital hardware design. When facing large designs, optimal approaches are likely to time out and heuristics fail to provide satisfying throughput and latency. We propose an isomorphic subgraph-based reduction of the input data-flow graph (DFG) that is applied ...
Patrick Sittel +3 more
openaire +1 more source
PathLAD+: Towards effective exact methods for subgraph isomorphism problem
Artificial IntelligencezbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yiyuan Wang, Chenghou Jin, Shaowei Cai
openaire +1 more source
Approximating the maximum common subgraph isomorphism problem with a weighted graph
Knowledge-Based Systems, 2015The maximum common subgraph isomorphism problem is a difficult graph problem, and the problem of finding the maximum common subgraph isomorphism problem is NP-hard. This means there is likely no algorithm that will be able to find the maximal isomorphic common subgraph in polynomial time because as the size of the graphs grows the search space for the ...
Alan Chia-Lung Chen +6 more
openaire +1 more source
A genetic and iterative local search algorithm for solving subgraph isomorphism problem
2015 International Conference on Industrial Engineering and Operations Management (IEOM), 2015Finding the subgraph of a graph that is isomorphic to a given graph has practicalapplications in several fields, from cheminformatics to image understanding. Since subgraph isomorphismproblem is NP-Hard, meta-heuristics are of especial use and importance in solving it. In this paper a hybrid metaheuristic algorithm for subgraph isomorphism is proposed.
Mina Mazraeh Farahani +1 more
openaire +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), 2019Ising 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
openaire +1 more source
Problems of synthesis of connected networks with respect to isomorphic subgraphs
Cybernetics and Systems Analysis, 2004zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
A QUBO Formulation For the K-densest Common Subgraph Isomorphism Problem Via Quantum Annealing
2020 IEEE Asia-Pacific Conference on Computer Science and Data Engineering (CSDE), 2020In this paper, we extend the algorithm of [6] to solve the k-densest maximum common subgraph problem. By solving the k-densest maximum common subgraph isomorphism problem, we find high complexity common substructures between input graphs. We prove that our proposed objective function always gives the right answer to the corresponding QUBO problem.
openaire +1 more source
Navigating financial toxicity in patients with cancer: A multidisciplinary management approach
Ca-A Cancer Journal for Clinicians, 2022Grace Li Smith +2 more
exaly
An Overview of Service Placement Problem in Fog and Edge Computing
ACM Computing Surveys, 2021Farah Ait Salaht
exaly
, 2021