Explicit sparse almost-universal graphs for ${\bf {{\cal G}(n, {k \over n})}}$-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

Explicit sparse almost-universal graphs for ${\bf {{\cal G}(n, {k \over n})}}$

Published:2010-10-21 Issue:4 Volume:37 Page:437-454
ISSN:1042-9832
Container-title:Random Structures & Algorithms
language:en
Short-container-title:Random Struct. Alg.

Author:

Capalbo Michael

Publisher

Wiley

Subject

Applied Mathematics,Computer Graphics and Computer-Aided Design,General Mathematics,Software

Reference20 articles.

1. Sparse universal graphs;Alon;J Computational Applied Mathematics,2002

2. Sparse universal graphs for bounded-degree graphs;Alon;Random Struct Algorithms (in press)

3. N. Alon M. Capalbo Optimal universal graphs with deterministic embeddings 2008 373 378

4. N. Alon M. Capalbo Y. Kohayakawa V. Rödl A. Ruciński E. Szemerédi Universality and tolerance 2000 14 21

5. Near-optimum universal graphs for graphs with bounded degrees;Alon;RANDOM-APPROX,2001

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Universality of random graphs and rainbow embedding;Random Structures & Algorithms;2015-07-07

2. An improved upper bound on the density of universal random graphs;Random Structures & Algorithms;2014-05-22

3. Expanders Are Universal for the Class of All Spanning Trees;Combinatorics, Probability and Computing;2013-01-03

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP