Results 71 to 80 of about 1,396 (204)
Combination theorems for Wise's power alternative
Journal of the London Mathematical Society, Volume 113, Issue 1, January 2026.Abstract We show that Wise's power alternative is stable under certain group constructions, use this to prove the power alternative for new classes of groups and recover known results from a unified perspective. For groups acting on trees, we introduce a dynamical condition that allows us to deduce the power alternative for the group from the power ...
Mark Hagen +2 more
wiley +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
In Situ Graph Reasoning and Knowledge Expansion Using Graph‐PRefLexOR
Advanced Intelligent Discovery, Volume 1, Issue 3, December 2025.Graph‐PRefLexOR is a novel framework that enhances language models with in situ graph reasoning, symbolic abstraction, and recursive refinement. By integrating graph‐based representations into generative tasks, the approach enables interpretable, multistep reasoning.
Markus J. Buehler
wiley +1 more source
Fast Construction on a Restricted Budget
Random Structures &Algorithms, Volume 67, Issue 4, December 2025.ABSTRACT We introduce a model of a controlled random graph process. In this model, the edges of the complete graph Kn$$ {K}_n $$ are ordered randomly and then revealed, one by one, to a player called Builder. He must decide, immediately and irrevocably, whether to purchase each observed edge.
Alan Frieze +2 more
wiley +1 more source
Generalized Fractional Total Colorings of Complete Graph
Discussiones Mathematicae Graph Theory, 2013 An additive and hereditary property of graphs is a class of simple graphs which is closed under unions, subgraphs and isomorphism. Let P and Q be two additive and hereditary graph properties and let r, s be integers such that r ≥ s Then an fractional (P,
Karafová Gabriela
doaj +1 more source
Subgraph Query for Building Service-Based Systems
IEEE Access, 2019 Given the broad applications of service-oriented architecture (SOA) in service-oriented software engineering, service-based systems (SBSs) built from existing Web services are becoming increasingly popular.
Jintao Wu +5 more
doaj +1 more source
AllDifferent-based filtering for subgraph isomorphism
Artificial Intelligence, 2010 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
(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
The contact cut graph and a Weinstein L$\mathcal {L}$‐invariant
Transactions of the London Mathematical Society, Volume 12, Issue 1, December 2025.Abstract We define and study the contact cut graph which is an analogue of Hatcher and Thurston's cut graph for contact geometry, inspired by contact Heegaard splittings (Giroux, Proceedings of the International Congress of Mathematicians, Beijing, 2002; Torisu, Internat. Math. Res. Notices (2000), 441–454).
Nickolas A. Castro +5 more
wiley +1 more source
Parallel Planar Subgraph Isomorphism and Vertex Connectivity [PDF]
, 2020 Lukas Gianinazzi, Torsten Hoefler
openalex +1 more source