Results 61 to 70 of about 1,956 (175)
Towards the boundary of the fine curve graph
Abstract The fine curve graph was introduced as a geometric tool to study homeomorphisms of surfaces. In this paper, we study the Gromov boundary of this space and the local topology near points associated with certain foliations and laminations. We then give several applications including finding dynamically explicit elements with positive stable ...
Jonathan Bowden +2 more
wiley +1 more source
Subgraph Isomorphism Meets Cutting Planes: Solving with Certified Solutions
Modern subgraph isomorphism solvers carry out sophisticated reasoning using graph invariants such as degree sequences and path counts. We show that all of this reasoning can be justified compactly using the cutting planes proofs studied in complexity ...
Ciaran McCreesh +5 more
core +1 more source
Thurston norm for coherent right‐angled Artin groups via L2$L^2$‐invariants
Abstract We define a new notion of splitting complexity for a group G$G$ along a non‐trivial integral character ϕ∈H1(G;Z)$\phi \in H^1(G; \mathbb {Z})$. If G$G$ is a one‐ended coherent right‐angled Artin group, we show that the splitting complexity along an epimorphism ϕ:G→Z$\phi \colon G \rightarrow \mathbb {Z}$ equals the L2$L^2$‐Euler characteristic
Monika Kudlinska
wiley +1 more source
The subgraph isomorphism problem for outerplanar graphs
This paper deals with the subgraph isomorphism problem for outerplanar graphs (SUBOUTISOM). In general, since trees and forests are outerplanar, SUBOUTISOM is NP-complete.
SysŁ;o, Maciej M.
core +1 more source
ABSTRACT We study eigenvalue problems for the de Rham complex on varying three‐dimensional domains. Our analysis includes the Helmholtz equation as well as the Maxwell system with mixed boundary conditions and non‐constant coefficients. We provide Hadamard‐type formulas for the shape derivatives under weak regularity assumptions on the domain and its ...
Pier Domenico Lamberti +2 more
wiley +1 more source
Generalized Fractional Total Colorings of Complete Graph
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
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
Exactness and the topology of the space of invariant random equivalence relations
Abstract We characterize exactness of a countable group Γ$\Gamma$ in terms of invariant random equivalence relations (IREs) on Γ$\Gamma$. Specifically, we show that Γ$\Gamma$ is exact if and only if every weak limit of finite IREs is an amenable IRE.
Héctor Jardón‐Sánchez +3 more
wiley +1 more source
Edge-Centric Federated Subgraph Isomorphism Counting via Residual Graph Neural Networks
Subgraph isomorphism counting is a fundamental yet computationally challenging task in graph analysis, with broad applications in bioinformatics and social network mining.
Jianjun Shi, Qinglong Wu, Xinming Zhang
doaj +1 more source
Non‐amenability of mapping class groups of infinite‐type surfaces and graphs
Abstract This paper completely determines the non‐amenability of the mapping class groups of infinite‐type surfaces, the mapping class groups of locally finite infinite graphs of higher ranks, gives an example of non‐amenable stabiliser of a point at infinity of a coarsely bounded generated hyperbolic Polish group, and exhibits a class of mapping class
Yusen Long
wiley +1 more source

