Results 71 to 80 of about 102,063 (249)
The Hardness of Subgraph Isomorphism
, 2015 Subgraph Isomorphism is a very basic graph problem, where given two graphs $G$ and $H$ one is to check whether $G$ is a subgraph of $H$. Despite its simple definition, the Subgraph Isomorphism problem turns out to be very broad, as it generalizes problems such as Clique, $r$-Coloring, Hamiltonicity, Set Packing and Bandwidth.
Cygan, Marek +2 more
openaire +2 more sources
Mining Frequent Neighborhood Patterns in Large Labeled Graphs [PDF]
, 2013 Over the years, frequent subgraphs have been an important sort of targeted patterns in the pattern mining literatures, where most works deal with databases holding a number of graph transactions, e.g., chemical structures of compounds. These methods rely
Han, Jialong, Wen, Ji-Rong
core +1 more source
Defining Recursive Predicates in Graph Orders [PDF]
Logical Methods in Computer Science, 2018 We study the first order theory of structures over graphs i.e. structures of the form ($\mathcal{G},\tau$) where $\mathcal{G}$ is the set of all (isomorphism types of) finite undirected graphs and $\tau$ some vocabulary.
Ramanathan S. Thinniyam
doaj +1 more source
Subgraph Isomorphism on Graph Classes that Exclude a Substructure [PDF]
Algorithmica, 2019 We study Subgraph Isomorphism on graph classes defined by a fixed forbidden graph. Although there are several ways for forbidding a graph, we observe that it is reasonable to focus on the minor relation since other well-known relations lead to either trivial or equivalent problems.
Hans L. Bodlaender +4 more
openaire +11 more sources
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
Entropy, 2023 In order to implement a quantum circuit on an NISQ device, it must be transformed into a functionally equivalent circuit that satisfies the device’s connectivity constraints.
Yang Qian +3 more
doaj +1 more source
Recent Advances in NASICON‐Type Electrolytes for Solid‐State Metal Batteries
Carbon Energy, EarlyView.NASICON‐type solid electrolytes are one of the potential candidates for solid‐state rechargeable batteries, which are paid much attention by both academic and industrial communities. ABSTRACT Compared to traditional liquid electrolyte batteries, solid metal batteries offer advantages such as a wide operating temperature range, high energy density, and ...
Jingrui Kang +17 more
wiley +1 more source
Graphs isomorphic to subgraphs of their line-graphs
Discrete Mathematics, 1982 AbstractAn embedding of graph G into graph H is by defenition an isomorphism of G onto a subgraph of H. It is shown in this paper that every unicycle U embeds in its line-graph L(U), and that every other connected graph that embeds in its own line-graph may be constructed from such an embedded unicycle in a natural way.
Ralph Tindell, Douglas Bauer
openaire +3 more sources
Dimer models and conformal structures
Communications on Pure and Applied Mathematics, EarlyView.Abstract Dimer models have been the focus of intense research efforts over the last years. Our paper grew out of an effort to develop new methods to study minimizers or the asymptotic height functions of general dimer models and the geometry of their frozen boundaries.
Kari Astala +3 more
wiley +1 more source
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