Brief Announcement: Efficient Collaborative Tree Exploration with Breadth-First Depth-Next

Author:

Cosson Romain1ORCID,Massoulie Laurent1ORCID,Viennot Laurent1ORCID

Affiliation:

1. Inria, Paris, France

Funder

Agence Nationale de la Recherche

Paris Artificial Intelligence Research Institute

Publisher

ACM

Reference11 articles.

1. Multirobot Tree and Graph Exploration

2. Romain Cosson , Laurent Massoulié , and Laurent Viennot . 2023. Breadth-First Depth-Next: Optimal Collaborative Exploration of Trees with Low Diameter. arXiv preprint arXiv:2301.13307 ( 2023 ). Romain Cosson, Laurent Massoulié, and Laurent Viennot. 2023. Breadth-First Depth-Next: Optimal Collaborative Exploration of Trees with Low Diameter. arXiv preprint arXiv:2301.13307 (2023).

3. Dariusz Dereniowski , Yann Disser , Adrian Kosowski , Dominik Pajak , and Przemyslaw Uznanski . 2013 . Fast Collaborative Graph Exploration. In Automata, Languages, and Programming - 40th International Colloquium, ICALP 2013, Riga, Latvia, July 8--12, 2013, Proceedings, Part II (Lecture Notes in Computer Science , Vol. 7966), Fedor V . Fomin, Rusins Freivalds, Marta Z. Kwiatkowska, and David Peleg (Eds.). Springer, 520--532. 10.1007/978-3-642-39212-2_46 Dariusz Dereniowski, Yann Disser, Adrian Kosowski, Dominik Pajak, and Przemyslaw Uznanski. 2013. Fast Collaborative Graph Exploration. In Automata, Languages, and Programming - 40th International Colloquium, ICALP 2013, Riga, Latvia, July 8--12, 2013, Proceedings, Part II (Lecture Notes in Computer Science, Vol. 7966), Fedor V. Fomin, Rusins Freivalds, Marta Z. Kwiatkowska, and David Peleg (Eds.). Springer, 520--532. 10.1007/978-3-642-39212-2_46

4. Yann Disser , Frank Mousset , Andreas Noever , Nemanja Skoric , and Angelika Steger . 2017 . A General Lower Bound for Collaborative Tree Exploration. In Structural Information and Communication Complexity - 24th International Colloquium, SIROCCO 2017 , Porquerolles, France, June 19--22 , 2017, Revised Selected Papers (Lecture Notes in Computer Science, Vol. 10641), Shantanu Das and Sébastien Tixeuil (Eds.). Springer, 125--139. 10.1007/978-3-319-72050-0_8 Yann Disser, Frank Mousset, Andreas Noever, Nemanja Skoric, and Angelika Steger. 2017. A General Lower Bound for Collaborative Tree Exploration. In Structural Information and Communication Complexity - 24th International Colloquium, SIROCCO 2017, Porquerolles, France, June 19--22, 2017, Revised Selected Papers (Lecture Notes in Computer Science, Vol. 10641), Shantanu Das and Sébastien Tixeuil (Eds.). Springer, 125--139. 10.1007/978-3-319-72050-0_8

5. Miroslaw Dynia , Miroslaw Korzeniowski , and Christian Schindelhauer . 2006 . Power-Aware Collective Tree Exploration. In Architecture of Computing Systems - ARCS 2006 , 19th International Conference, Frankfurt/Main, Germany, March 13--16, 2006, Proceedings (Lecture Notes in Computer Science , Vol. 3894), Werner Grass, Bernhard Sick, and Klaus Waldschmidt (Eds.). Springer, 341-- 351 . 10.1007/11682127_24 Miroslaw Dynia, Miroslaw Korzeniowski, and Christian Schindelhauer. 2006. Power-Aware Collective Tree Exploration. In Architecture of Computing Systems - ARCS 2006, 19th International Conference, Frankfurt/Main, Germany, March 13--16, 2006, Proceedings (Lecture Notes in Computer Science, Vol. 3894), Werner Grass, Bernhard Sick, and Klaus Waldschmidt (Eds.). Springer, 341--351. 10.1007/11682127_24

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP

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