On Subgraph Isomorphism
英文摘要：
Article explicitly expresses Subgraph Isomorphism by a polynomial size asymmetric linear system.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
相关论文
Graph Isomorphism for Graph Classes Characterized by two Forbidden Induced Subgraphs
We study the complexity of the Graph Isomorphism problem on graph classes that are characterized by a finite number of forbidden induced subgraphs, focusing mostly on the case of two forbidden subgraphs. We show hardness results and develop techniques for the structural analysis of such graph classes, which applied to the case of two forbidden subgraphs give the following results: A dichotomy into isomorphism complete and polynomial-time solvable graph classes for all but finitely many cases, whenever neither of the forbidden graphs is a clique, a pan, or a complement of these graphs. Further …
cs.CCcs.DMcs.DS
Structure Theorem and Isomorphism Test for Graphs with Excluded Topological Subgraphs
We generalize the structure theorem of Robertson and Seymour for graphs excluding a fixed graph $H$ as a minor to graphs excluding $H$ as a topological subgraph. We prove that for a fixed $H$, every graph excluding $H$ as a topological subgraph has a tree decomposition where each part is either "almost embeddable" to a fixed surface or has bounded degree with the exception of a bounded number of vertices. Furthermore, we prove that such a decomposition is computable by an algorithm that is fixed-parameter tractable with parameter $|H|$. We present two algorithmic applications of our structure …
cs.DMcs.DSmath.CO
Planar Subgraph Isomorphism Revisited
The problem of Subgraph Isomorphism is defined as follows: Given a pattern H and a host graph G on n vertices, does G contain a subgraph that is isomorphic to H? Eppstein [SODA 95, J'GAA 99] gives the first linear time algorithm for subgraph isomorphism for a fixed-size pattern, say of order k, and arbitrary planar host graph, improving upon the O(n^\sqrt{k})-time algorithm when using the ``Color-coding'' technique of Alon et al [J'ACM 95]. Eppstein's algorithm runs in time k^O(k) n, that is, the dependency on k is superexponential. We solve an open problem posed in Eppstein's paper and improv…
cs.DMcs.DS
排除小型拓扑子图的图同构测试
Isomorphism Testing for Graphs Excluding Small Topological Subgraphs
针对排除h顶点拓扑子图的n顶点图，提出运行时间为$n^{\text{polylog}(h)}$的同构测试，统一并扩展了此前关于最大度d、Hadwiger数h的图同构测试结果。
cs.DMcs.DSmath.CO
Faster Algorithms for Finding and Counting Subgraphs
In this paper we study a natural generalization of both {\sc $k$-Path} and {\sc $k$-Tree} problems, namely, the {\sc Subgraph Isomorphism} problem. In the {\sc Subgraph Isomorphism} problem we are given two graphs $F$ and $G$ on $k$ and $n$ vertices respectively as an input, and the question is whether there exists a subgraph of $G$ isomorphic to $F$. We show that if the treewidth of $F$ is at most $t$, then there is a randomized algorithm for the {\sc Subgraph Isomorphism} problem running in time $\cO^*(2^k n^{2t})$. To do so, we associate a new multivariate {Homomorphism polynomial} of degre…
cs.DMcs.DS
Affine maps between quadratic assignment polytopes and subgraph isomorphism polytopes
We consider two polytopes. The quadratic assignment polytope $QAP(n)$ is the convex hull of the set of tensors $x\otimes x$, $x \in P_n$, where $P_n$ is the set of $n\times n$ permutation matrices. The second polytope is defined as follows. For every permutation of vertices of the complete graph $K_n$ we consider appropriate $\binom{n}{2} \times \binom{n}{2}$ permutation matrix of the edges of $K_n$. The Young polytope $P((n-2,2))$ is the convex hull of all such matrices. In 2009, S. Onn showed that the subgraph isomorphism problem can be reduced to optimization both over $QAP(n)$ and over $P(…
cs.CCcs.DMmath.CO
更多相关论文收起更多论文
Surface Split Decompositions and Subgraph Isomorphism in Graphs on Surfaces
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. After a sequence of improvements, the current best algorithm for planar graphs is a linear time algorithm by Dorn (STACS '10), with complexity $2^{O(k)} O(n)$. We generalize this result, by giving an algorithm of the same complexity for graphs that can be embedded in surfaces of bounded genus. At the same time, we simplify the algorithm and analysis. The key to th…
cs.DM
使用stigmergic群集智能体的$O(p \text{log} d)$子图同构
$O(p \log d)$ Subgraph Isomorphism using Stigmergic Swarming Agents
针对NP完全的带标签节点子图同构问题，提出受蚁群优化启发的ASSIST算法，将复杂度降至$O(p \text{log} d)$，并支持时间有序边等其他启发式难以处理的匹配场景。
cs.DMcs.MA
基于群体行为的快速子图同构算法
Stigmergic Swarming Agents for Fast Subgraph Isomorphism
ABC Research（ABC研究院）
ASSIST是一种基于群体行为的快速子图同构算法，通过线性时间复杂度解决NP难问题，支持复杂匹配需求。
cs.DMcs.MA
Beating Treewidth for Average-Case Subgraph Isomorphism
For any fixed graph $G$, the subgraph isomorphism problem asks whether an $n$-vertex input graph has a subgraph isomorphic to $G$. A well-known algorithm of Alon, Yuster and Zwick (1995) efficiently reduces this to the "colored" version of the problem, denoted $G$-$\mathsf{SUB}$, and then solves $G$-$\mathsf{SUB}$ in time $O(n^{tw(G)+1})$ where $tw(G)$ is the treewidth of $G$. Marx (2010) conjectured that $G$-$\mathsf{SUB}$ requires time $Ω(n^{\mathrm{const}\cdot tw(G)})$ and, assuming the Exponential Time Hypothesis, proved a lower bound of $Ω(n^{\mathrm{const}\cdot emb(G)})$ for a certain gr…
cs.CCcs.DMcs.DS
Recognition and Isomorphism of Proper $\boldsymbol{U}$-graphs in FPT-time
An $H$-graph is an intersection graph of connected subgraphs of a suitable subdivision of a fixed graph $H$. Many important classes of graphs, including interval graphs, circular-arc graphs, and chordal graphs, can be expressed as $H$-graphs, and, in particular, every graph is an $H$-graph for a suitable graph $H$. An $H$-graph is called proper if it has a representation where no subgraph properly contains another. We consider the recognition and isomorphism problems for proper $U$-graphs where $U$ is a unicylic graph. We prove that testing whether a graph is a (proper) $U$-graph, for some $U$…
cs.CCcs.DMcs.DS
Decomposing a Graph into Unigraphs
Unigraphs are graphs uniquely determined by their own degree sequence up to isomorphism. There are many subclasses of unigraphs such as threshold graphs, split matrogenic graphs, matroidal graphs, and matrogenic graphs. Unigraphs and these subclasses are well studied in the literature. Nevertheless, there are few results on superclasses of unigraphs. In this paper, we introduce two types of generalizations of unigraphs: $k$-unigraphs and $k$-strong unigraphs. We say that a graph $G$ is a $k$-unigraph if $G$ can be partitioned into $k$ unigraphs. $G$ is a $k$-strong unigraph if not only each su…
cs.DMcs.DSmath.CO
Efficient Isomorphism for $S_d$-graphs and $T$-graphs
An $H$-graph is one representable as the intersection graph of connected subgraphs of a suitable subdivision of a fixed graph $H$, introduced by Biró, Hujter and Tuza (1992). An $H$-graph is proper if the representing subgraphs of $H$ can be chosen incomparable by the inclusion. In this paper, we focus on the isomorphism problem for $S_d$-graphs and $T$-graphs, where $S_d$ is the star with $d$ rays and $T$ is an arbitrary fixed tree. Answering an open problem of Chaplick, Töpfer, Voborn\'ık and Zeman (2016), we provide an FPT-time algorithm for testing isomorphism and computing the automorphis…
cs.DMcs.DS
On Weisfeiler-Leman Invariance: Subgraph Counts and Related Graph Properties
The $k$-dimensional Weisfeiler-Leman algorithm ($k$-WL) is a fruitful approach to the Graph Isomorphism problem. 2-WL corresponds to the original algorithm suggested by Weisfeiler and Leman over 50 years ago. 1-WL is the classical color refinement routine. Indistinguishability by $k$-WL is an equivalence relation on graphs that is of fundamental importance for isomorphism testing, descriptive complexity theory, and graph similarity testing which is also of some relevance in artificial intelligence. Focusing on dimensions $k=1,2$, we investigate subgraph patterns whose counts are $k$-WL invaria…
cs.CCcs.DMcs.LO
稠密随机图之间的同构
Isomorphisms between dense random graphs
本文研究两个稠密随机图之间的诱导子图同构问题，通过改进第一和第二矩方法，证明了诱导子图出现的尖锐阈值、最大公共诱导子图大小的两点集中性以及诱导副本数量的不寻常极限分布，从而证实了已有模拟预测并解决了若干开放问题。
cs.DMmath.COmath.PR
A Polynomial Time Graph Isomorphism Algorithm For Graphs That Are Not Locally Triangle-Free
In this paper, we show the existence of a polynomial time graph isomorphism algorithm for all graphs excluding graphs that are locally trianglefree. This particular class of graphs allows to divide the graph into neighbourhood sub-graph where each of induced sub-graph (neighbourhood) has at least 2 vertices. We construct all possible permutations for each induced sub-graph using a search tree. We construct automorphisms of subgraphs based on these permutations. Finally, we decide isomorphism through automorphisms . The author expects that the solution, present in this paper, may lead to a fast…
cs.DMcs.DSmath.CO
论重构式颜色细化的表达能力
On the Expressibility of the Reconstructional Color Refinement
The Institute of Mathematical Sciences (HBNI)（数学科学研究所（HBNI））；Chennai Mathematical Institute（金奈数学研究所）；Institut für Informatik, Humboldt-Universität zu Berlin（柏林洪堡大学计算机科学研究所）；IAPMM
本文证明在颜色细化等价而非完全同构的顶点删除子图牌组下仍可判定图连通性，从而说明 Reconstruction Graph Neural Networks 能识别连通性。
cs.CCcs.DMcs.LG
