Results 31 to 40 of about 11,556 (115)
DDSL: Efficient Subgraph Listing on Distributed and Dynamic Graphs
, 2020 Subgraph listing is a fundamental problem in graph theory and has wide applications in areas like sociology, chemistry, and social networks. Modern graphs can usually be large-scale as well as highly dynamic, which challenges the efficiency of existing ...
DB West +5 more
core +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
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
Genetic Algorithm-based Mapper to Support Multiple Concurrent Users on Wireless Testbeds
, 2016 Communication and networking research introduces new protocols and standards with an increasing number of researchers relying on real experiments rather than simulations to evaluate the performance of their new protocols.
Azmy, Michael +2 more
core +1 more source
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
Diameter and Treewidth in Minor-Closed Graph Families
, 1999 It is known that any planar graph with diameter D has treewidth O(D), and this fact has been used as the basis for several planar graph algorithms. We investigate the extent to which similar relations hold in other graph families.
Eppstein, David
core +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
Reduction Techniques for Graph Isomorphism in the Context of Width Parameters
, 2014 We study the parameterized complexity of the graph isomorphism problem when parameterized by width parameters related to tree decompositions. We apply the following technique to obtain fixed-parameter tractability for such parameters. We first compute an
A. Bouland +15 more
core +1 more source
Weighted Turán Theorems With Applications to Ramsey‐Turán Type of Problems
Journal of Graph Theory, Volume 110, Issue 1, Page 59-71, September 2025.ABSTRACT We study extensions of Turán Theorem in edge‐weighted settings. A particular case of interest is when constraints on the weight of an edge come from the order of the largest clique containing it. These problems are motivated by Ramsey‐Turán type problems.
József Balogh +2 more
wiley +1 more source
Network Evolution With Mesoscopic Delays
Random Structures &Algorithms, Volume 67, Issue 2, September 2025.ABSTRACT Owing to the influence of real‐world networks both in science and society, numerous mathematical models have been developed to understand the structure and evolution of these systems, particularly in a temporal context. Recent advancements in fields like distributed cyber‐security and social networks have spurred the creation of probabilistic ...
Sayan Banerjee +3 more
wiley +1 more source