Results 1 to 10 of about 16,183 (155)
IEICE Transactions on Information and Systems, 2021 SUMMARY Ising machines have attracted attention as they are expected to solve combinatorial optimization problems at high speed with Ising models corresponding to those problems.
Natsuhito YOSHIMURA +6 more
semanticscholar +4 more sources
On the First-Order Complexity of Induced Subgraph Isomorphism [PDF]
Logical Methods in Computer Science, 2019 Given a graph $F$, let $I(F)$ be the class of graphs containing $F$ as an induced subgraph. Let $W[F]$ denote the minimum $k$ such that $I(F)$ is definable in $k$-variable first-order logic.
Oleg Verbitsky, Maksim Zhukovskii
doaj +3 more sources
On Minimal Unique Induced Subgraph Queries
Applied Sciences, 2018 In this paper, a novel type of interesting subgraph query is proposed: Minimal Unique Induced Subgraph (MUIS) query. Given a (large) graph G and a query vertex (position) q in the graph, can we find an induced subgraph containing q with the minimal ...
Lincheng Jiang +6 more
doaj +2 more sources
Efficient Algorithms for Subgraph Listing
Algorithms, 2014 Subgraph isomorphism is a fundamental problem in graph theory. In this paper we focus on listing subgraphs isomorphic to a given pattern graph. First, we look at the algorithm due to Chiba and Nishizeki for listing complete subgraphs of fixed size, and ...
Niklas Zechner, Andrzej Lingas
doaj +2 more sources
A Zero Knowledge Authentication Protocol Based on Novel Heuristic Algorithm of Dense Induced Subgraphs Isomorphism [PDF]
Engineering and Technology Journal, 2015 Graphs provide an useful mathematical tool for modeling various real world phenomena. Dense graphs arise in many places of interest, for instance the internet and social networks to name just two. The density of a graph should be a real number reflecting
N. M. G. Al-Saidi +2 more
doaj +1 more source
Qubit Mapping Based on Subgraph Isomorphism and Filtered Depth-Limited Search [PDF]
IEEE transactions on computers, 2020 Mapping logical quantum circuits to Noisy Intermediate-Scale Quantum (NISQ) devices is a challenging problem which has attracted rapidly increasing interests from both quantum and classical computing communities. This article proposes an efficient method
Sanjiang Li, Xiang-Yu Zhou, Yuan Feng
semanticscholar +1 more source
Induced Cycles and Paths Are Harder Than You Think [PDF]
IEEE Annual Symposium on Foundations of Computer Science, 2022 The goal of the paper is to give fine-grained hardness results for the Subgraph Isomorphism (SI) problem for fixed size induced patterns H, based on the k-Clique hypothesis that the current best algorithms for Clique are optimal. Our first main result is
Mina Dalirrooyfard, V. V. Williams
semanticscholar +1 more source
On the Power of the Weisfeiler-Leman Test for Graph Motif Parameters [PDF]
International Conference on Learning Representations, 2023 Seminal research in the field of graph neural networks (GNNs) has revealed a direct correspondence between the expressive capabilities of GNNs and the $k$-dimensional Weisfeiler-Leman ($k$WL) test, a widely-recognized method for verifying graph ...
Matthias Lanzinger, Pablo Barcel'o
semanticscholar +1 more source
Combinatorics and Algorithms for Quasi-Chain Graphs [PDF]
Algorithmica, 2021 The class of quasi-chain graphs is an extension of the well-studied class of chain graphs. This latter class enjoys many nice and important properties, such as bounded clique-width, implicit representation, well-quasi-ordering by induced subgraphs, etc ...
Bogdan Alecu +3 more
semanticscholar +1 more source
A Learning Based Branch and Bound for Maximum Common Subgraph Related Problems
AAAI Conference on Artificial Intelligence, 2020 The performance of a branch-and-bound (BnB) algorithm for maximum common subgraph (MCS) problem and its related problems, like maximum common connected subgraph (MCCS) and induced Subgraph Isomorphism (SI), crucially depends on the branching heuristic ...
Yanli Liu, Chu Min Li, Hua Jiang, Kun He
semanticscholar +1 more source