刊名
执行
中图分类
执行
    中文(共37篇) 外文(共4104篇)
    排序:
    导出 保存至文件
    [期刊]   Kang, Mihyun   Missethan, Michael   《SIAM Journal on Discrete Mathematics》    2023年37卷1期      共17页
    摘要 : We study the random planar graph process introduced by Gerke et al. [Random Structures Algorithms, 32 (2008), pp. 236--261]: Begin with an empty graph on n vertices, consider the edges of the complete graph Kn one by one in a rand... 展开

    [期刊]   Jerzy Jaworski   Michal Karonski   Dudley Stark   《Discrete mathematics》    2006年306卷18期      共14页
    摘要 : In this paper we consider the degree of a typical vertex in two models of random intersection graphs introduced in [E. Godehardt, J. Jaworski, Two models of random intersection graphs for classification, in: M. Schwaiger, O. Opitz... 展开

    [机翻] 几何随机图与非均匀随机图
    [期刊]   Napolitano, George M.   Turova, Tatyana   《Markov Processes and Related Fields》    2019年25卷4期      共23页
    摘要 : We consider random graphs on the set of vertices placed on the discrete d-dimensional torus. The edges between pairs of vertices are independent, and their probabilities depend on the distance between the vertices. Hence, the prob... 展开

    [期刊]   Sudakov, B   Krivelevich, M   《Geometric and functional analysis: GAFA》    2009年19卷1期      共38页
    摘要 : We propose a unifying framework for studying extremal problems related to graph minors. This framework relates the existence of a large minor in a given graph to its expansion properties. We then apply the developed framework to s... 展开

    [期刊]   Gao, Y.   《Discrete Applied Mathematics》    2012年160卷4/5期      共13页
    摘要 : We study conditions under which the treewidth of three different classes of random graphs is linear in the number of vertices. For the Erd?s- Rényi random graph G(n,m), our result improves a previous lower bound obtained by Kloks... 展开

    [期刊]   Goldreich, O.   Goldwasser, S.   Nussboim, A.   《SIAM Journal on Computing》    2010年39卷7/8期      共62页
    摘要 : We initiate a general study of the feasibility of implementing (huge) random objects, and demonstrate its applicability to a number of areas in which random objects occur naturally. We highlight two types of measures of the qualit... 展开

    [期刊]   Yue Shi   Haizhong Shi   《Discrete mathematics, algorithms, and applications》    2017年9卷2期      共11页
    摘要 : There tend to be no related researches regarding the relationships between graph theory and languages ever since the concept of graph-semigroup was first proposed in 1991. In 2011, after finding out the inner co-relations among di... 展开

    [期刊]   Diaz, J   Kaporis, AC   Kemkes, GD   Kirousis, LM   Perez, X   Wormald, N   《Journal of Graph Theory》    2009年61卷3期      共35页
    摘要 : It was only recently shown by Shi and Wormald, using the differential equation method to analyze an appropriate algorithm, that a random 5-regular graph asymptotically almost surely has chromatic number at most 4. Here, we show th... 展开

    [期刊]   Baron, Jacob D.   Kahn, Jeff   《Random structures & algorithms》    2019年54卷1期      共30页
    摘要 : Write C(G) for the cycle space of a graph G, C-kappa(G) for the subspace of C(G) spanned by the copies of the kappa-cycle C-kappa in G, T-kappa for the class of graphs satisfying C-kappa(G)=C(G), and Q(kappa) for the class of grap... 展开

    摘要 : Abstract Hyperbolic random graphs (HRGs) and geometric inhomogeneous random graphs (GIRGs) are two similar generative network models that were designed to resemble complex real-world networks. In particular, they have a power-law ... 展开

    研究趋势
    相关热图
    学科分类