Results 111 to 120 of about 101,745 (269)
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
Profinite rigidity for free‐by‐cyclic groups with centre
Journal of the London Mathematical Society, Volume 111, Issue 6, June 2025.Abstract A free‐by‐cyclic group FN⋊ϕZ$F_N\rtimes _\phi \mathbb {Z}$ has non‐trivial centre if and only if [ϕ]$[\phi]$ has finite order in Out(FN)${\rm {Out}}(F_N)$. We establish a profinite rigidity result for such groups: if Γ1$\Gamma _1$ is a free‐by‐cyclic group with non‐trivial centre and Γ2$\Gamma _2$ is a finitely generated free‐by‐cyclic group ...
Martin R. Bridson, Paweł Piwek
wiley +1 more source
Qubit allocation as a combination of subgraph isomorphism and token swapping
Proc. ACM Program. Lang., 2019 In 2016, the first quantum processors have been made available to the general public. The possibility of programming an actual quantum device has elicited much enthusiasm. Yet, such possibility also brought challenges.
Marcos Yukio Siraichi +3 more
semanticscholar +1 more source
On profinite rigidity amongst free‐by‐cyclic groups I: The generic case
Proceedings of the London Mathematical Society, Volume 130, Issue 6, June 2025.Abstract We prove that amongst the class of free‐by‐cyclic groups, Gromov hyperbolicity is an invariant of the profinite completion. We show that whenever G$G$ is a free‐by‐cyclic group with first Betti number equal to one, and H$H$ is a free‐by‐cyclic group which is profinitely isomorphic to G$G$, the ranks of the fibres and the characteristic ...
Sam Hughes, Monika Kudlinska
wiley +1 more source
Incremental View Maintenance for Deductive Graph Databases Using Generalized Discrimination Networks [PDF]
Electronic Proceedings in Theoretical Computer Science, 2016 Nowadays, graph databases are employed when relationships between entities are in the scope of database queries to avoid performance-critical join operations of relational databases.
Thomas Beyhl, Holger Giese
doaj +1 more source
Rigidity of graph products of abelian groups
, 2007 We show that if $G$ is a group and $G$ has a graph-product decomposition with finitely-generated abelian vertex groups, then $G$ has two canonical decompositions as a graph product of groups: a unique decomposition in which each vertex group is a ...
Gutierrez, Mauricio, Piggott, Adam
core +1 more source
Deep Analysis on Subgraph Isomorphism
, 2020 Subgraph isomorphism is a well-known NP-hard problem which is widely used in many applications, such as social network analysis and knowledge graph query. Its performance is often limited by the inherent hardness. Several insightful works have been done since 2012, mainly optimizing pruning rules and matching orders to accelerate enumerating all ...
Zeng, Li +3 more
openaire +2 more sources
On the Ubiquity of Oriented Double Rays
Journal of Graph Theory, Volume 109, Issue 1, Page 62-67, May 2025.ABSTRACT A digraph H is called ubiquitous if every digraph that contains arbitrarily many vertex‐disjoint copies of H
wiley +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 +2 more
core +1 more source
On Rainbow Turán Densities of Trees
Random Structures &Algorithms, Volume 66, Issue 3, May 2025.ABSTRACT For a given collection 𝒢=(G1,…,Gk) of graphs on a common vertex set V$$ V $$, which we call a graph system, a graph H$$ H $$ on a vertex set V(H)⊆V$$ V(H)\subseteq V $$ is called a rainbow subgraph of 𝒢 if there exists an injective function ψ:E(H)→[k]$$ \psi :E(H)\to \left[k\right] $$ such that e∈Gψ(e)$$ e\in {G}_{\psi (e)} $$ for each e∈E(H)$$
Seonghyuk Im +3 more
wiley +1 more source