Asymptotically optimal induced universal graphs-Reference-Cited by-同舟云学术

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

Asymptotically optimal induced universal graphs

Published:2017-02 Issue:1 Volume:27 Page:1-32
ISSN:1016-443X
Container-title:Geometric and Functional Analysis
language:en
Short-container-title:Geom. Funct. Anal.

Author:

Alon Noga

Publisher

Springer Science and Business Media LLC

Subject

Geometry and Topology,Analysis

Link

http://link.springer.com/content/pdf/10.1007/s00039-017-0396-9.pdf

Reference31 articles.

1. M. Ajtai, J. Komlós and E. Szemerédi. First occurrence of Hamilton cycles in random graphs. In: Cycles in Graphs (Burnaby, B.C., 1982), pp. 173–178, North-Holland Math. Stud., Vol. 115. North-Holland, Amsterdam (1985).

2. Alon N.: Bipartite decomposition of random graphs. J. Combinatorial Theory, Ser. B 113, 220–235 (2015)

3. N. Alon and J.H. Spencer. The Probabilistic Method, Fourth Edition. Wiley, London (2016), pp. xv+375.

4. S. Alstrup, H. Kaplan, M. Thorup and U. Zwick. Adjacency Labeling Schemes and Induced-Universal Graphs, Proc. STOC 2015, pp. 625–634.

5. S. Alstrup, S. Dahlgaard and M. Knudsen. Optimal Induced Universal Graphs and Adjacency Labeling for Trees, Proc. FOCS 2015, pp. 1311–1326.

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

1. Implicit Representation of Sparse Hereditary Families;Discrete & Computational Geometry;2023-07-24

2. Isomorphisms between random graphs;Journal of Combinatorial Theory, Series B;2023-05

3. The Implicit Graph Conjecture is False;2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS);2022-10

4. Shorter Labeling Schemes for Planar Graphs;SIAM Journal on Discrete Mathematics;2022-08-31

5. An Adjacency Labeling Scheme Based on a Decomposition of Trees into Caterpillars;Lecture Notes in Computer Science;2022

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号京ICP备18003416号-3