Results 41 to 50 of about 23,139 (195)
TM-Miner: TFS-Based Algorithm for Mining Temporal Motifs in Large Temporal Network
IEEE Access, 2019 Temporal network is a basic tool for representing complex systems, such as communication networks and social networks; besides the temporal motif (TM) plays an important role in the analysis of temporal networks.
Xiaoli Sun +4 more
doaj +1 more source
Fast parallel algorithms for the subgraph homeomorphism and the subgraph isomorphism problem for classes of planar graphs [PDF]
, 1987 We consider the problems of subgraph homeomorphism with fixed pattern graph, recognition, and subgraph isomorphism for some classes of planar graphs. Following the results of Robertson and Seymour on forbidden minor characterization, we show that the problems of fixed subgraph homeomorphism and recognition for any family of planar graphs closed under ...
Lingas, Andrzej, Proskurowski, Andrzej
openaire +1 more source
A Triangle Framework among Subgraph Isomorphism, Pharmacophore and Structure-function Relationship
The Web Conference, 2022 Coronavirus disease 2019 (COVID-19) has gained utmost attention in the current time from academic research and industrial practices because it continues to rage in many countries.
Mengjiao Guo +4 more
semanticscholar +1 more source
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 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 +7 more
wiley +1 more source
Trade-Offs Computing Minimum Hub Cover Toward Optimized Labeled Graph Query Processing
Online Academic Journal of Information Technology, 2018 As techniques for graph query processing mature, the need for optimization is increasingly becoming an imperative. Indices are one of the key ingredients toward efficient query processing strategies via cost-based optimization.
Hasan M. Jamil +3 more
doaj +1 more source
Number of Subgraphs and Their Converses in Tournaments and New Digraph Polynomials
Journal of Graph Theory, Volume 110, Issue 2, Page 127-131, October 2025.ABSTRACT An oriented graph D is converse invariant if, for any tournament T, the number of copies of D in T is equal to that of its converse − D. El Sahili and Ghazo Hanna [J. Graph Theory 102 (2023), 684‐701] showed that any oriented graph D with maximum degree at most 2 is converse invariant. They proposed a question: Can we characterize all converse
Jiangdong Ai +4 more
wiley +1 more source
On Endomorphism Universality of Sparse Graph Classes
Journal of Graph Theory, Volume 110, Issue 2, Page 223-244, October 2025.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
Accelerating Subgraph Matching Through Advanced Compression and Label Filtering
AlgorithmsEfficiently 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