Results 61 to 70 of about 17,360 (200)

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  

(Random) Trees of Intermediate Volume Growth

Random Structures &Algorithms, Volume 67, Issue 4, December 2025.
ABSTRACT For every function g:ℝ≥0→ℝ≥0$$ g:{\mathbb{R}}_{\ge 0}\to {\mathbb{R}}_{\ge 0} $$ that grows at least linearly and at most exponentially, if it is sufficiently well‐behaved, we can construct a tree T$$ T $$ of uniform volume growth g$$ g $$, or more precisely, C1·g(r/4)≤|BG(v,r)|≤C2·g(4r),for allr≥0andv∈V(T),$$ {C}_1\cdotp g\left(r/4\right)\le \
George Kontogeorgiou, Martin Winter
wiley   +1 more source

Accelerating Subgraph Matching Through Advanced Compression and Label Filtering

Algorithms
Efficiently identifying subgraphs that match a given query graph within large-scale graphs has become a critical focus in both academic and industrial research.
Yanfeng Chai, Jiashu Li, Qiang Zhang
doaj   +1 more source

Frequent Subgraph Mining in Outerplanar Graphs [PDF]

, 2010
In recent years there has been an increased interest in frequent pattern discovery in large databases of graph structured objects. While the frequent connected subgraph mining problem for tree datasets can be solved in incremental polynomial time, it ...
Horvath, Tamas, Ramon, Jan, Wrobel, Stefan   +2 more
core   +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

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, Zhengyang Hu, Meng Niu, Jiahui Wang, Zexuan Qi, Zejian Zheng, Yazi Liu, Cuiping Jia, Xinai Ren, Tianle Yang, Shiyao Xu, Tianyu Wu, Yongsong Liu, Dingquan Wang, Shijin Yuan, Xiaoyong Wei, Yao Liu, Lei Liu   +17 more
wiley   +1 more source

Explainable Neural Subgraph Matching With Learnable Multi-Hop Attention

IEEE Access
Subgraph matching is a challenging problem with a wide range of applications in drug discovery, social network analysis, biochemistry, and cognitive science.
Duc Q. Nguyen, Thanh Toan Nguyen, Jun Jo, Florent Poux, Shikha Anirban, Tho T. Quan   +5 more
doaj   +1 more source

A Method for the Quality‐Aware Automated Selection of Deployment Technologies

Software: Practice and Experience, Volume 55, Issue 11, Page 1855-1876, November 2025.
ABSTRACT Domain The deployment of distributed multi‐component cloud applications typically requires a combination of multiple heterogeneous deployment technologies. A different combination of deployment technologies should be chosen due to varying deployment qualities, such as the functional suitability and reliability of the deployment technologies ...
Miles Stötzner, Niklas Krieger, Sandro Speth, Marcel Weller, Steffen Becker, Benjamin Weder, Jacopo Soldani, Valentin Morlock   +7 more
wiley   +1 more source

A Selectivity based approach to Continuous Pattern Detection in Streaming Graphs [PDF]

, 2015
Cyber security is one of the most significant technical challenges in current times. Detecting adversarial activities, prevention of theft of intellectual properties and customer data is a high priority for corporations and government agencies around the
Agarwal, Khushbu, Chin, George, Choudhury, Sutanay, Feo, John, Holder, Lawrence   +4 more
core  

Asymmetric graphs with quantum symmetry

Proceedings of the London Mathematical Society, Volume 131, Issue 5, November 2025.
Abstract We present an infinite sequence of finite graphs with trivial automorphism group and non‐trivial quantum automorphism group. These are the first known examples of graphs with this property. Moreover, to the best of our knowledge, these are the first examples of any asymmetric classical space that has non‐trivial quantum symmetries.
Josse van Dobben de Bruyn, David E. Roberson, Simon Schmidt   +2 more
wiley   +1 more source