Distinguishing views in symmetric networks: A tight lower bound-Reference-Cited by-同舟云学术

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

Distinguishing views in symmetric networks: A tight lower bound

Published:2015-05 Issue: Volume:582 Page:27-34
ISSN:0304-3975
Container-title:Theoretical Computer Science
language:en
Short-container-title:Theoretical Computer Science

Author:

Dereniowski Dariusz,Kosowski Adrian,Pająk Dominik

Funder

National Science Centre of Poland

ANR

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference20 articles.

1. Fibrations of graphs;Boldi;Discrete Math.,2002

2. Universal dynamic synchronous self-stabilization;Boldi;Distrib. Comput.,2002

3. Constructing a map of an anonymous graph: applications of universal sequences;Chalopin,2010

4. An efficient message passing election algorithm based on Mazurkiewicz's algorithm;Chalopin;Fund. Inform.,2007

5. How to meet when you forget: log-space rendezvous in arbitrary graphs;Czyzowicz;Distrib. Comput.,2012

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

1. Proper distinguishing arc-colourings of symmetric digraphs;Applied Mathematics and Computation;2022-05

2. Topology recognition and leader election in colored networks;Theoretical Computer Science;2016-03

3. Setting Ports in an Anonymous Network: How to Reduce the Level of Symmetry?;Structural Information and Communication Complexity;2016

4. Universal Covers, Color Refinement, and Two-Variable Counting Logic: Lower Bounds for the Depth;2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science;2015-07

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP