Embedding bounded degree spanning trees in random graphs. https://arxiv.org/abs/1405.6559 (2014).R. Montgomery. Embedding bounded degree spanning trees in random graphs. arXiv preprint arXiv:1405.6559 (2014).R. Montgomery, Embedding bounded degree spanning trees in random graphs, arXiv:1405.6559...
Local resilience of almost spanning trees in random graphs We prove that for fixed integer D and positive reals α and γ, there exists a constant C0 such that for all p satisfying p(n) ≥ C0/n, the random graph G(... J Balogh,B Csaba,W Samotij - 《Random Structures & Algorithms...
Physicists recently observed that realistic complex networks emerge as discrete samples from a continuous hyperbolic geometry enclosed in a circle: the radius represents the node centrality and the angular displacement between two nodes resembles their t
Network Function Virtualization (NFV) opens us great opportunities for network processing with higher resource efficiency and flexibility. In this respect,
In this paper, a deterministic algorithm for dynamically embedding binary trees into next to optimal hypercubes is presented. Due to a known lower bound, any such algorithm must use either randomization or migration, i.e., remapping of tree vertices, to obtain an embedding of trees into hypercub...
This allows us to improve a result on almost spanning trees by Balogh, Csaba, Pei and Samotij.doi:10.48550/arXiv.1405.6560Montgomery, RichardMontgomery, R., Sharp threshold for embedding combs and other spanning trees in random graphs (2014), arXiv:1405.6560 ....
The article titled "Correction to 'Sharp threshold for embedding balanced spanning trees in random geometric graphs'" in the Journal of Graph Theory contains a correction to the acknowledgments section. The original text incorrectly stated the sources of support for the research. The corre...
Yet, graphs are still not the common data structure in patte... K Riesen,H Bunke - Emerging Topics In Computer Vision And Its Applications 被引量: 21发表: 2011年 Embedding large graphs into a random graph. In this paper we consider the problem of embedding almost-spanning, bounded degree...
Our work introduces spectral embedding as a new tool in analysing reversible Markov chains. Furthermore, building on [33], we design a local algorithm to approximate the number of spanning trees of massive graphs.LyonsDepartment of Mathematics...
Recently, Sudakov and Vondrák =-=[43]-=- gave a randomized algorithm to efficiently embed bounded degree almost spanning trees in graphs with certain expansion properties. We discuss the result of Haxell in Section 3. For pn > log n, the si...B. Sudakov and J. Vondr´ak, A ...