Results 21 to 30 of about 16,397 (156)
When Subgraph Isomorphism is Really Hard, and Why This Matters for Graph Databases
Journal of Artificial Intelligence Research, 2018 The subgraph isomorphism problem involves deciding whether a copy of a pattern graph occurs inside a larger target graph. The non-induced version allows extra edges in the target, whilst the induced version does not.
Ciaran McCreesh +3 more
semanticscholar +1 more source
Restricted Space Algorithms for Isomorphism on Bounded Treewidth Graphs [PDF]
, 2010 The Graph Isomorphism problem restricted to graphs of bounded treewidth or bounded tree distance width are known to be solvable in polynomial time [Bod90],[YBFT99].
Das, Bireswar +2 more
core +5 more sources
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
Matched Filters for Noisy Induced Subgraph Detection [PDF]
, 2018 The problem of finding the vertex correspondence between two noisy graphs with different number of vertices where the smaller graph is still large has many applications in social networks, neuroscience, and computer vision.
Lyzinski, Vince +3 more
core +1 more source
Towards an Isomorphism Dichotomy for Hereditary Graph Classes [PDF]
, 2014 In this paper we resolve the complexity of the isomorphism problem on all but finitely many of the graph classes characterized by two forbidden induced subgraphs.
Schweitzer, Pascal
core +3 more sources
Finding Induced Subgraphs via Minimal Triangulations [PDF]
, 2009 Potential maximal cliques and minimal separators are combinatorial objects which were introduced and studied in the realm of minimal triangulations problems including Minimum Fill-in and Treewidth.
Fomin, Fedor V., Villanger, Yngve
core +6 more sources
Induced Minor Free Graphs: Isomorphism and Clique-width
, 2016 Given two graphs $G$ and $H$, we say that $G$ contains $H$ as an induced minor if a graph isomorphic to $H$ can be obtained from $G$ by a sequence of vertex deletions and edge contractions.
Belmonte, Rémy +2 more
core +1 more source
On 2-switches and isomorphism classes [PDF]
, 2011 A 2-switch is an edge addition/deletion operation that changes adjacencies in the graph while preserving the degree of each vertex. A well known result states that graphs with the same degree sequence may be changed into each other via sequences of 2 ...
Barrus +10 more
core +2 more sources
Weighted Turán Theorems With Applications to Ramsey‐Turán Type of Problems
Journal of Graph Theory, EarlyView.ABSTRACT We study extensions of Turán Theorem in edge‐weighted settings. A particular case of interest is when constraints on the weight of an edge come from the order of the largest clique containing it. These problems are motivated by Ramsey‐Turán type problems.
József Balogh +2 more
wiley +1 more source
On Endomorphism Universality of Sparse Graph Classes
Journal of Graph Theory, EarlyView.ABSTRACT We show that every commutative idempotent monoid (a.k.a. lattice) is the endomorphism monoid of a subcubic graph. This solves a problem of Babai and Pultr and the degree bound is best‐possible. On the other hand, we show that no class excluding a minor can have all commutative idempotent monoids among its endomorphism monoids. As a by‐product,
Kolja Knauer, Gil Puig i Surroca
wiley +1 more source