記事
Exploration of dynamic networks: Tight bounds on the number of agents
デジタルデータあり(Crossref)
すぐに読む
CiNii Research
Exploration of dynamic networks: Tight bounds on the number of agents
- 資料種別
- 記事
- 著者
- Tsuyoshi Gotohほか
- 出版者
- Elsevier BV
- 出版年
- 2021-12
- 資料形態
- デジタル
- 掲載誌名
- Journal of Computer and System Sciences 122
- 掲載ページ
- p.1-18
全国の図書館の所蔵
国立国会図書館以外の全国の図書館の所蔵状況を表示します。
所蔵のある図書館から取寄せることが可能かなど、資料の利用方法は、ご自身が利用されるお近くの図書館へご相談ください
書誌情報
この資料の詳細や典拠(同じ主題の資料を指すキーワード、著者名)等を確認できます。
デジタル
- 資料種別
- 記事
- 出版年月日等
- 2021-12
- 出版年(W3CDTF)
- 2021-12
- タイトル(掲載誌)
- Journal of Computer and System Sciences
- 巻号年月日等(掲載誌)
- 122
- 掲載巻
- 122
- 掲載ページ
- 1-18
- 掲載年月日(W3CDTF)
- 2021-12
- ISSN(掲載誌)
- 00220000
- 出版事項(掲載誌)
- Elsevier BV
- 件名標目
- 対象利用者
- 一般
- DOI
- 10.1016/j.jcss.2021.04.003
- 作成日(W3CDTF)
- 2021-05-11
- 著作権情報
- https://www.elsevier.com/tdm/userlicense/1.0/https://doi.org/10.15223/policy-017https://doi.org/10.15223/policy-037https://doi.org/10.15223/policy-012https://doi.org/10.15223/policy-029https://doi.org/10.15223/policy-004
- 関連情報(URI)
- 参照
- Exploring an unknown graphTraveling salesman problems in temporal graphsDeterministic Network Exploration by Anonymous Silent Agents with Local Traffic ReportsImpact of memory size on graph exploration capabilitySelf-stabilizing robots in highly dynamic environmentsDistributed Algorithms For Unidirectional NetworksGraph Explorations with Mobile AgentsEconomic Traversal of LabyrinthsMobile Agents on Dynamic GraphsDoes adding more agents make a difference? A case study of cover time for the rotor-routerDynamic graph modelsGraph exploration by a finite automatonMeasuring Temporal Lags in Delay-Tolerant NetworksExploring Unknown Undirected GraphsRobustness of the Rotor–Router MechanismDistributed exploration of dynamic ringsBuilding a reference combinatorial model for MANETsOn the exploration of time-varying networksGathering in dynamic ringsSearching for Black Holes in SubwaysA Distributed Ant Algorithm for\protect Efficiently Patrolling a NetworkTime-varying graphs and dynamic networksExploration of the T-Interval-Connected Dynamic Graphs: the Case of the RingExploring Unknown EnvironmentsLabel-guided graph exploration by a finite automatonGracefully degrading gathering in dynamic ringsOn the power of waiting when exploring public transportation systemsExploration of dynamic ring networks by a single agent with the h-hops and s-time steps viewHow to explore a fast-changing worldExploration of high-dimensional grids by finite automataA game of cops and robbers on graphs with periodic edge-connectivityDeterministic dispersion of mobile robots in dynamic ringsGroup exploration of dynamic toriDistributed computation in dynamic networksComputability of perpetual exploration in highly dynamic ringsExploration of constantly connected dynamic graphs based on cactusesLower bounds on information dissemination in dynamic networksNetwork exploration by silent and oblivious robotsFaster exploration of degree-bounded temporal graphsPresentation of a maze-solving machineDeterministic computations in time-varying graphs: broadcasting under unstructured mobilityCoordinated consensus in dynamic networksOn temporal graph explorationTwo moves per time step make a difference
- 連携機関・データベース
- 国立情報学研究所 : CiNii Research
- 提供元機関・データベース
- Crossref科学研究費助成事業データベース