Constructing a Map of an Anonymous Graph: Applications of Universal Sequences
Author:
Publisher
Springer Berlin Heidelberg
Link
http://link.springer.com/content/pdf/10.1007/978-3-642-17653-1_10
Reference26 articles.
1. Albers, S., Henzinger, M.R.: Exploring unknown environments. SIAM Journal on Computing 29(4), 1164–1188 (2000)
2. Aleliunas, R., Karp, R.M., Lipton, R.J., Lovász, L., Rackoff, C.: Random walks, universal traversal sequences, and the complexity of maze problems. In: 20th Annual Symposium on Foundations of Computer Science (FOCS 1979), pp. 218–223 (1979)
3. Ando, E., Ono, H., Sadakane, K., Yamashita, M.: The space complexity of leader election in anonymous networks. International Journal of Foundations of Computer Science 21(3), 427–440 (2010)
4. Angluin, D.: Local and global properties in networks of processors. In: 12th Symposium on Theory of Computing (STOC 1980), pp. 82–93 (1980)
5. Barrière, L., Flocchini, P., Fraigniaud, P., Santoro, N.: Rendezvous and election of mobile agents: impact of sense of direction. Theory of Computing Systems 40(2), 143–162 (2007)
Cited by 44 articles. 订阅此论文施引文献 订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Graph exploration by a deterministic memoryless automaton with pebbles;Discrete Applied Mathematics;2024-10
2. Almost Universal Anonymous Rendezvous in the Plane;Algorithmica;2023-05-11
3. Want to Gather? No Need to Chatter!;SIAM Journal on Computing;2023-03-15
4. Edge exploration of anonymous graph by mobile agent with external help;Computing;2022-11-29
5. The Space Complexity of Undirected Graph Exploration;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