Results 81 to 90 of about 21,959 (221)
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
Uncertainty-Aware Efficient Subgraph Isomorphism Using Graph Topology
Pattern RecognitionSubgraph isomorphism, also known as subgraph matching, is typically regarded as an NP-complete problem. This complexity is further compounded in practical applications where edge weights are real-valued and may be affected by measurement noise and potential missing data.
Arpan Kusari, Wenbo Sun
openalex +3 more sources
Subgraph isomorphism in graph classes
Discrete Mathematics, 2012 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kijima, Shuji +3 more
openaire +2 more sources
Recent Advances in NASICON‐Type Electrolytes for Solid‐State Metal Batteries
Carbon Energy, Volume 7, Issue 11, November 2025.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
Portfolios of Subgraph Isomorphism Algorithms [PDF]
, 2016 Subgraph isomorphism is a computationally challenging problem with\ud important practical applications, for example in computer vision, biochemistry,\ud and model checking. There are a number of state-of-the-art algorithms for solving\ud the problem, each of which has its own performance characteristics.
Kotthoff, Lars +2 more
openaire +2 more sources
Taming subgraph isomorphism for RDF query processing [PDF]
Proceedings of the VLDB Endowment, 2015 RDF data are used to model knowledge in various areas such as life sciences, Semantic Web, bioinformatics, and social graphs. The size of real RDF data reaches billions of triples. This calls for a framework for efficiently processing RDF data. The core function of processing RDF data is subgraph pattern matching.
Kim, Jinha +4 more
openaire +2 more sources
Recognizing Trees From Incomplete Decks
Journal of Graph Theory, Volume 110, Issue 3, Page 322-336, November 2025.ABSTRACT Given a graph G, the unlabeled subgraphs G − v are called the cards of G. The deck of G is the multiset { G − v : v ∈ V ( G ) }. Wendy Myrvold showed that a disconnected graph and a connected graph both on n vertices have at most ⌊ n 2 ⌋ + 1 cards in common and found (infinite) families of trees and disconnected forests for which this upper ...
Gabriëlle Zwaneveld
wiley +1 more source
Sidorenko's conjecture for higher tree decompositions [PDF]
, 2018 This is a companion note to our paper 'Some advances on Sidorenko's conjecture', elaborating on a remark in that paper that the approach which proves Sidorenko's conjecture for strongly tree-decomposable graphs may be extended to a broader class ...
Conlon, David +3 more
core +1 more source
Practical Bigraphs via Subgraph Isomorphism [PDF]
, 2021 Bigraphs simultaneously model the spatial and non-spatial relationships between entities, and have been used for systems modelling in areas including biology, networking, and sensors. Temporal evolution can be modelled through a rewriting system, driven by a matching algorithm that identifies instances of bigraphs to be rewritten. The previous state-of-
Archibald, Blair +3 more
openaire +2 more sources