Results 101 to 110 of about 102,063 (249)
Tight bounds for intersection‐reverse sequences, edge‐ordered graphs, and applications
Journal of the London Mathematical Society, Volume 112, Issue 4, October 2025.Abstract In 2006, Marcus and Tardos proved that if A1,⋯,An$A^1,\dots,A^n$ are cyclic orders on some subsets of a set of n$n$ symbols such that the common elements of any two distinct orders Ai$A^i$ and Aj$A^j$ appear in reversed cyclic order in Ai$A^i$ and Aj$A^j$, then ∑i|Ai|=O(n3/2logn)$\sum _{i} |A^i|=O(n^{3/2}\log n)$.
Barnabás Janzer +3 more
wiley +1 more source
Application of dynamic expansion tree for finding large network motifs in biological networks [PDF]
PeerJ, 2019 Network motifs play an important role in the structural analysis of biological networks. Identification of such network motifs leads to many important applications such as understanding the modularity and the large-scale structure of biological networks,
Sabyasachi Patra, Anjali Mohapatra
doaj +2 more sources
Prosoluble subgroups of the profinite completion of the fundamental group of compact 3‐manifolds
Journal of the London Mathematical Society, Volume 112, Issue 4, October 2025.Abstract We give a description of finitely generated prosoluble subgroups of the profinite completion of 3‐manifold groups and toral relatively hyperbolic virtually compact special groups.
Lucas C. Lopes, Pavel A. Zalesskii
wiley +1 more source
On the Hilbert series of vertex cover algebras of unmixed bipartite graphs [PDF]
, 2010 We compute the reduced Gr\"{o}bner basis of the toric ideal with respect to a suitable monomial order and we study the Hilbert series of the vertex cover algebra $A(G)$, where $G$ is an unmixed bipartite graph without isolated vertices.Comment: 8 ...
Ion, Cristian
core
A Chronological Edge-Driven Approach to Temporal Subgraph Isomorphism [PDF]
2018 IEEE International Conference on Big Data (Big Data), 2018 A useful technique for adversary activity graph analytics is to perform subgraph isomorphism; searching for a specific graph pattern within a larger graph.
Patrick Mackey +4 more
semanticscholar +1 more source
Computing and Drawing Isomorphic Subgraphs [PDF]
, 2002 The isomorphic subgraph problem is finding two disjoint subgraphs of a graph which coincide on at least k edges. Then the graph partitions into a large subgraph, its copy and a remainder. The problem resembles the NP-hard largest common subgraph problem.
Franz-Josef Brandenburg, Sabine Bachl
openaire +2 more sources
The conjugacy problem for ascending HNN‐extensions of free groups
Proceedings of the London Mathematical Society, Volume 131, Issue 4, October 2025.Abstract We give an algorithm to solve the Conjugacy Problem for ascending HNN‐extensions of free groups. To do this, we give algorithms to solve certain problems on dynamics of free group endomorphisms.
Alan D. Logan
wiley +1 more source
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
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