Results 21 to 30 of about 11,556 (115)
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
FS^3: A Sampling based method for top-k Frequent Subgraph Mining [PDF]
, 2014 Mining labeled subgraph is a popular research task in data mining because of its potential application in many different scientific domains. All the existing methods for this task explicitly or implicitly solve the subgraph isomorphism task which is ...
Hasan, Mohammad Al, Saha, Tanay Kumar
core +3 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
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
Pattern matching and pattern discovery algorithms for protein topologies [PDF]
, 2001 We describe algorithms for pattern matching and pattern learning in TOPS diagrams (formal descriptions of protein topologies). These problems can be reduced to checking for subgraph isomorphism and finding maximal common subgraphs in a restricted ...
C. Bron +14 more
core +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
Orthogonal polarity graphs and Sidon sets [PDF]
, 2014 Determining the maximum number of edges in an $n$-vertex $C_4$-free graph is a well-studied problem that dates back to a paper of Erd\H{o}s from 1938. One of the most important families of $C_4$-free graphs are the Erd\H{o}s-R\'enyi orthogonal polarity ...
Tait, Michael, Timmons, Craig
core
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
Real models for the framed little n$n$‐disks operads
Journal of Topology, Volume 18, Issue 4, December 2025.Abstract We study the action of the orthogonal group on the little n$n$‐disks operads. As an application we provide small models (over the reals) for the framed little n$n$‐disks operads. It follows in particular that the framed little n$n$‐disks operads are formal (over the reals) for n$n$ even and coformal for all n$n$.
Anton Khoroshkin, Thomas Willwacher
wiley +1 more source
A Necessary and Sufficient Condition for Graph Matching to be equivalent to Clique Search [PDF]
, 2009 This paper formulates a necessary and sufficient condition for a generic graph matching problem to be equivalent to the maximum vertex and edge weight clique problem in a derived association graph.
Jain, Brijnesh
core