Results 111 to 120 of about 16,183 (155)
Some of the next articles are maybe not open access.
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
Isomorphisms Between Dense Random Graphs
Combinatorica, 2023We consider two variants of the induced subgraph isomorphism problem for two independent binomial random graphs with constant edge-probabilities p1,p2\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts ...
Erlang Surya, L. Warnke, Emily Zhu
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
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
On the Information-Theoretic Limit of Subgraph Alignment
International Symposium on Information TheoryThe graph alignment problem aims to identify the vertex correspondence between two correlated graphs. Most existing work focuses on the scenario where the two graphs share the same vertex set.
Chun Hei Michael Shiu +2 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
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
Finding Order-Preserving Subgraphs
arXiv.org(Induced) Subgraph Isomorphism and Maximum Common (Induced) Subgraph are fundamental problems in graph pattern matching and similarity computation. In graphs derived from time-series data or protein structures, a natural total ordering of vertices often ...
Haruya Imamura +7 more
semanticscholar +1 more source
From Graph Properties to Graph Parameters: Tight Bounds for Counting on Small Subgraphs
ACM-SIAM Symposium on Discrete AlgorithmsA graph property is a function $\Phi$ that maps every graph to {0, 1} and is invariant under isomorphism. In the $\#IndSub(\Phi)$ problem, given a graph $G$ and an integer $k$, the task is to count the number of $k$-vertex induced subgraphs $G'$ with ...
Simon Doring +2 more
semanticscholar +1 more source