Results 41 to 50 of about 39,682 (219)
Everything you always wanted to know about the parameterized complexity of Subgraph Isomorphism (but were afraid to ask) [PDF]
, 2013 Given two graphs H and G, the Subgraph Isomorphism problem asks if H is isomorphic to a subgraph of G. While NP-hard in general, algorithms exist for various parameterized versions of the problem.
Marx, Dániel, Pilipczuk, Michal
core +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 +1 more source
Faster Algorithms for the Maximum Common Subtree Isomorphism Problem [PDF]
, 2016 The maximum common subtree isomorphism problem asks for the largest possible isomorphism between subtrees of two given input trees. This problem is a natural restriction of the maximum common subgraph problem, which is ${\sf NP}$-hard in general graphs ...
Droschinsky, Andre +2 more
core +2 more sources
Subgraph Query for Building Service-Based Systems
IEEE Access, 2019 Given the broad applications of service-oriented architecture (SOA) in service-oriented software engineering, service-based systems (SBSs) built from existing Web services are becoming increasingly popular.
Jintao Wu +5 more
doaj +1 more source
cuTS: Scaling Subgraph Isomorphism on Distributed Multi-GPU Systems Using Trie Based Data Structure [PDF]
, 2021 Subgraph isomorphism is a pattern-matching algorithm widely used in many domains such as chem-informatics, bioinformatics, databases, and social network analysis. It is computationally expensive and is a proven NP-hard problem. The massive parallelism in
Halappanavar, Mahantesh +4 more
core +1 more source
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 +1 more source
Electronics, 2023 The resource scheduling problem of UAV communication networks has always been a hot research issue in the current environment. However, most of the current research focuses on meeting the user’s time cost requirements and rarely considers the user’s ...
Yanyan Han +7 more
semanticscholar +1 more source
Quantum Query Complexity of Subgraph Isomorphism and Homomorphism [PDF]
, 2015 Let $H$ be a fixed graph on $n$ vertices. Let $f_H(G) = 1$ iff the input graph $G$ on $n$ vertices contains $H$ as a (not necessarily induced) subgraph. Let $\alpha_H$ denote the cardinality of a maximum independent set of $H$. In this paper we show: \[
Kulkarni, Raghav, Podder, Supartha
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
GC : a graph caching system for subgraph / supergraph queries [PDF]
We demonstrate a graph caching system GC for expediting subgraph/supergraph queries, which are computationally expensive due to the entailed NP-Complete subgraph isomorphism problem.
Liu, Zichen +4 more
core +1 more source