Distributed Subgraph Finding: Progress and Challenges

-д хадгалсан:
Номзүйн дэлгэрэнгүй
-д хэвлэсэн:arXiv.org (Dec 22, 2024), p. n/a
Үндсэн зохиолч: Censor-Hillel, Keren
Хэвлэсэн:
Cornell University Library, arXiv.org
Нөхцлүүд:
Онлайн хандалт:Citation/Abstract
Full text outside of ProQuest
Шошгууд: Шошго нэмэх
Шошго байхгүй, Энэхүү баримтыг шошголох эхний хүн болох!

MARC

LEADER 00000nab a2200000uu 4500
001 2639113898
003 UK-CbPIL
022 |a 2331-8422 
035 |a 2639113898 
045 0 |b d20241222 
100 1 |a Censor-Hillel, Keren 
245 1 |a Distributed Subgraph Finding: Progress and Challenges 
260 |b Cornell University Library, arXiv.org  |c Dec 22, 2024 
513 |a Working Paper 
520 3 |a This is a survey of the exciting recent progress made in understanding the complexity of distributed subgraph finding problems. It overviews the results and techniques for assorted variants of subgraph finding problems in various models of distributed computing, and states intriguing open questions. This version contains some updates over the ICALP 2021 version, and I will try to keep updating it as additional progress is made. 
653 |a Graph theory 
653 |a Computer networks 
653 |a Distributed processing 
773 0 |t arXiv.org  |g (Dec 22, 2024), p. n/a 
786 0 |d ProQuest  |t Engineering Database 
856 4 1 |3 Citation/Abstract  |u https://www.proquest.com/docview/2639113898/abstract/embedded/ZKJTFFSVAI7CB62C?source=fedsrch 
856 4 0 |3 Full text outside of ProQuest  |u http://arxiv.org/abs/2203.06597