Results 111 to 120 of about 16,397 (156)
Some of the next articles are maybe not open access.
Efficient Streaming Subgraph Isomorphism with Graph Neural Networks
Proceedings of the VLDB Endowment, 2021Queries to detect isomorphic subgraphs are important in graph-based data management. While the problem of subgraph isomorphism search has received considerable attention for the static setting of a single query, or a batch thereof, existing approaches do
Chi Thang Duong +5 more
semanticscholar +1 more source
Efficient Implementation of Color Coding Algorithm for Subgraph Isomorphism Problem
Analysis of Experimental Algorithms - Special Event, 2019We consider the subgraph isomorphism problem where, given two graphs G (source graph) and F (pattern graph), one is to decide whether there is a (not necessarily induced) subgraph of G isomorphic to F.
J. Malík, Ondřej Suchý, T. Valla
semanticscholar +1 more source
Logical complexity of induced subgraph isomorphism for certain families of graphs
, 2019We investigate the problem of the most efficient first-order definition of the property of containing an induced subgraph isomorphic to a given pattern graph, which is closely related to the time complexity of the decision problem for this property.
M. Zhukovskii +3 more
semanticscholar +1 more source
The edge‐subgraph poset of a graph and the edge reconstruction conjecture
Journal of Graph Theory, 2019We consider only finite simple graphs in this paper. Earlier we showed that many invariants of a graph can be computed from the isomorphism class of its partially ordered set of distinct unlabeled non‐empty induced subgraphs, that is, the subgraphs ...
Bhalchandra D. Thatte
semanticscholar +1 more source
Changing Induced Subgraph Isomorphisms Under Extended Reconfiguration Rules
Workshop on Algorithms and ComputationIn a reconfiguration problem, we are given two feasible solutions of a combinatorial problem and our goal is to determine whether it is possible to reconfigure one into the other, with the steps dictated by specific reconfiguration rules.
Tatsuhiro Suga +3 more
semanticscholar +1 more source
Finding induced subgraphs in scale-free inhomogeneous random graphs
Workshop on Algorithms and Models for the Web-Graph, 2018We study the induced subgraph isomorphism problem on inhomogeneous random graphs with infinite variance power-law degrees. We provide a fast algorithm that determines for any connected graph $H$ on $k$ vertices if it exists as induced subgraph in a ...
Ellen Cardinaels +2 more
semanticscholar +1 more source
On the Computational Complexity of Ordered Subgraph Recognition
Random Struct. Algorithms, 1995Let (G,
D. Duffus, M. Ginn, V. Rödl
semanticscholar +1 more source
Foundations of Software Technology and Theoretical Computer Science, 2018
Given a host graph G and a pattern graph H, the induced subgraph isomorphism problem is to decide whether G contains an induced subgraph that is isomorphic to H. We study the time complexity of induced subgraph isomorphism problems when the pattern graph
M. Bläser +2 more
semanticscholar +1 more source
Given a host graph G and a pattern graph H, the induced subgraph isomorphism problem is to decide whether G contains an induced subgraph that is isomorphic to H. We study the time complexity of induced subgraph isomorphism problems when the pattern graph
M. Bläser +2 more
semanticscholar +1 more source
Induced Subforests and Superforests
arXiv.orgGraph isomorphism, subgraph isomorphism, and maximum common subgraphs are classical well-investigated objects. Their (parameterized) complexity and efficiently tractable cases have been studied.
Dieter Rautenbach, Florian Werner
semanticscholar +1 more source
Subexponential Time Algorithms for Embedding H-Minor Free Graphs
International Colloquium on Automata, Languages and Programming, 2016We establish the complexity of several graph embedding problems: Subgraph Isomorphism, Graph Minor, Induced Subgraph and Induced Minor, when restricted to H-minor free graphs.
H. Bodlaender +2 more
semanticscholar +1 more source