Results 1 to 10 of about 16,397 (156)
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.
Nozomu Togawa +6 more
semanticscholar +5 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
Between Subgraph Isomorphism and Maximum Common Subgraph [PDF]
, 2017 When a small pattern graph does not occur inside a larger target graph, we can ask how to find "as much of the pattern as possible" inside the target graph.
Hoffmann, Ruth +2 more
core +1 more source
A Partitioning Algorithm for Maximum Common Subgraph Problems [PDF]
, 2017 We introduce a new branch and bound algorithm for the maximum common subgraph and maximum common connected subgraph problems which is based around vertex labelling and partitioning.
McCreesh, Ciaran +2 more
core +2 more sources
Maximum common subgraph isomorphism algorithms for the matching of chemical structures [PDF]
, 2002 The maximum common subgraph (MCS) problem has become increasingly important in those aspects of chemoinformatics that involve the matching of 2D or 3D chemical structures. This paper provides a classification and a review of the many MCS algorithms, both
Raymond, J.W., Willett, P.
core +2 more sources
Surface Split Decompositions and Subgraph Isomorphism in Graphs on Surfaces [PDF]
, 2011 The Subgraph Isomorphism problem asks, given a host graph G on n vertices and a pattern graph P on k vertices, whether G contains a subgraph isomorphic to P. The restriction of this problem to planar graphs has often been considered.
Bonsma, Paul
core +5 more sources
Some hard families of parameterised counting problems [PDF]
, 2014 We consider parameterised subgraph-counting problems of the following form: given a graph G, how many k-tuples of its vertices have a given property? A number of such problems are known to be #W[1]-complete; here we substantially generalise some of these
Jerrum, Mark, Meeks, Kitty
core +3 more sources