咨询与建议

限定检索结果

文献类型

  • 42 篇 会议
  • 33 篇 期刊文献

馆藏范围

  • 75 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 69 篇 工学
    • 67 篇 计算机科学与技术...
    • 13 篇 电气工程
    • 11 篇 软件工程
    • 10 篇 信息与通信工程
    • 4 篇 控制科学与工程
    • 1 篇 网络空间安全
  • 14 篇 理学
    • 14 篇 数学
    • 1 篇 统计学(可授理学、...
  • 1 篇 管理学
    • 1 篇 管理科学与工程(可...

主题

  • 75 篇 distributed grap...
  • 7 篇 lower bounds
  • 6 篇 congest
  • 6 篇 maximal matching
  • 5 篇 combinatorial to...
  • 5 篇 distributed comp...
  • 4 篇 minimum spanning...
  • 4 篇 local model
  • 4 篇 maximal independ...
  • 3 篇 approximation al...
  • 3 篇 network decompos...
  • 3 篇 vertex coloring
  • 3 篇 derandomization
  • 3 篇 congest model
  • 2 篇 fractional match...
  • 2 篇 distributed veri...
  • 2 篇 parallel graph a...
  • 2 篇 consensus
  • 2 篇 crash failures
  • 2 篇 message complexi...

机构

  • 13 篇 swiss fed inst t...
  • 7 篇 univ freiburg fr...
  • 5 篇 technion haifa
  • 5 篇 technion dept co...
  • 4 篇 cnrs
  • 4 篇 univ paris
  • 3 篇 univ nacl autono...
  • 3 篇 univ bordeaux bo...
  • 3 篇 eth zurich
  • 3 篇 cnrs irif
  • 3 篇 aalto univ espoo
  • 3 篇 natl univ singap...
  • 2 篇 weizmann inst sc...
  • 2 篇 univ vienna fac ...
  • 2 篇 univ paris cite
  • 2 篇 swiss fed inst t...
  • 2 篇 univ freiburg de...
  • 2 篇 mit cambridge ma...
  • 2 篇 carnegie mellon ...
  • 2 篇 university of fr...

作者

  • 12 篇 ghaffari mohsen
  • 9 篇 paz ami
  • 8 篇 kuhn fabian
  • 8 篇 fraigniaud pierr...
  • 8 篇 censor-hillel ke...
  • 7 篇 maus yannic
  • 7 篇 suomela jukka
  • 6 篇 brandt sebastian
  • 5 篇 chang yi-jun
  • 5 篇 uitto jara
  • 5 篇 hirvonen juho
  • 4 篇 roy matthieu
  • 4 篇 rajsbaum sergio
  • 4 篇 travers corentin
  • 4 篇 castaneda armand...
  • 3 篇 robinson peter
  • 3 篇 balliu alkida
  • 3 篇 olivetti dennis
  • 3 篇 feuilloley laure...
  • 3 篇 pandurangan gopa...

语言

  • 74 篇 英文
  • 1 篇 其他
检索条件"主题词=distributed graph algorithms"
75 条 记 录,以下是21-30 订阅
A topological perspective on distributed network algorithms
收藏 引用
THEORETICAL COMPUTER SCIENCE 2021年 849卷 121-137页
作者: Castaneda, Armando Fraigniaud, Pierre Paz, Ami Rajsbaum, Sergio Roy, Matthieu Travers, Corentin Univ Nacl Autonoma Mexico Mexico City DF Mexico CNRS Paris France Univ Paris Paris France Univ Vienna CS Fac Vienna Austria Univ Bordeaux Bordeaux France
More than two decades ago, combinatorial topology was shown to be useful for analyzing distributed fault-tolerant algorithms in shared memory systems and in message passing systems. In this work, we show that combinat... 详细信息
来源: 评论
Redundancy in distributed proofs
收藏 引用
distributed COMPUTING 2021年 第2期34卷 113-132页
作者: Feuilloley, Laurent Fraigniaud, Pierre Hirvonen, Juho Paz, Ami Perry, Mor Univ Chile Santiago Chile Univ Paris CNRS IRIF Paris France Aalto Univ Espoo Finland Univ Vienna Fac Comp Sci Vienna Austria Weizmann Inst Sci Rehovot Israel
distributed proofs are mechanisms that enable the nodes of a network to collectively and efficiently check the correctness of Boolean predicates on the structure of the network (e.g., having a specific diameter), or o... 详细信息
来源: 评论
Property testing of planarity in the CONGEST model
收藏 引用
distributed COMPUTING 2021年 第1期34卷 15-32页
作者: Levi, Reut Medina, Moti Ron, Dana Interdisciplinary Ctr Efi Arazi Sch Comp Sci Herzliyya Israel Ben Gurion Univ Negev Sch Elect & Comp Engn Beer Sheva Israel Tel Aviv Univ Sch Elect Engn Tel Aviv Israel
We give a distributed algorithm in the CONGEST model for property testing of planarity with one-sided error in general (unbounded-degree) graphs. Following Censor-Hillel et al. (Proceedings of the 30th International S... 详细信息
来源: 评论
Low-congestion shortcut and graph parameters
收藏 引用
distributed COMPUTING 2021年 第5期34卷 349-365页
作者: Kitamura, Naoki Kitagawa, Hirotaka Otachi, Yota Izumi, Taisuke Nagoya Inst Technol Syowa Ku Gokiso Cho Nagoya Aichi Japan Nagoya Univ Chikusa Ku Huro Cho Nagoya Aichi Japan Osaka Univ 1-5 Yamadaoka Suita Osaka Japan
distributed graph algorithms in the standard CONGEST model often exhibit the time-complexity lower bound of (Omega) over tilde(root n+ D) rounds for several global problems, where n denotes the number of nodes and D t... 详细信息
来源: 评论
Deterministic Near-Optimal distributed Listing of Cliques  22
Deterministic Near-Optimal Distributed Listing of Cliques
收藏 引用
41st ACM Symposium on Principles of distributed Computing, PODC 2022
作者: Censor-Hillel, Keren Leitersdorf, Dean Vulakh, David Technion - Israel Institute of Technology Haifa Israel Massachusetts Institute of Technology CambridgeMA United States
The importance of classifying connections in large graphs has been the motivation for a rich line of work on distributed subgraph finding that has led to exciting recent breakthroughs. A crucial aspect that remained o... 详细信息
来源: 评论
Synchronous t-resilient consensus in arbitrary graphs
收藏 引用
INFORMATION AND COMPUTATION 2023年 第1期292卷
作者: Castaneda, Armando Fraigniaud, Pierre Paz, Ami Rajsbaum, Sergio Roy, Matthieu Travers, Corentin Univ Nacl Autonoma Mexico Inst Matemat Mexico City Mexico CNRS IRIF Paris France Univ Paris Cite Paris France CNRS LISN Paris France Univ Paris Saclay Paris France CNRS LAAS Toulouse France Univ Aix Marseille LIS Marseille France
We study the number of rounds needed to solve consensus in a synchronous network G where at most t nodes may fail by crashing. This problem has been thoroughly studied when G is a complete graph, but very little is kn... 详细信息
来源: 评论
TeraHAC: Hierarchical Agglomerative Clustering of Trillion-Edge graphs
收藏 引用
Proceedings of the ACM on Management of Data 2023年 第3期1卷 1-27页
作者: Laxman Dhulipala Jakub Łącki Jason Lee Vahab Mirrokni UMD & Google Research Bethesda MD USA Google Research New York NY USA
We introduce TeraHAC, a (1+ε)-approximate hierarchical agglomerative clustering (HAC) algorithm which scales to trillion-edge graphs. Our algorithm is based on a new approach to computing (1+ε)-approximate HAC, whic... 详细信息
来源: 评论
Near-optimal distributed Triangle Enumeration via Expander Decompositions
收藏 引用
JOURNAL OF THE ACM 2021年 第3期68卷 1–36页
作者: Chang, Yi-Jun Pettie, Seth Saranurak, Thatchaphol Zhang, Hengjie Swiss Fed Inst Technol Inst Theoret Studies Clausiusstr 47 CH-8092 Zurich Switzerland Univ Michigan Comp Sci & Engn 2260 Hayward St Ann Arbor MI 48109 USA Columbia Univ Dept Comp Sci 500 W 120th St New York NY 10027 USA
We present improved distributed algorithms for variants of the triangle finding problem in the CONGEST modeL We show that triangle detection, counting, and enumeration can be solved in (O) over tilden(1/3)) rounds usi... 详细信息
来源: 评论
Improved Partitioning graph Embedding Framework for Small Cluster  14th
Improved Partitioning Graph Embedding Framework for Small Cl...
收藏 引用
14th International Conference on Knowledge Science, Engineering, and Management (KSEM)
作者: Sun, Ding Huang, Zhen Li, Dongsheng Ye, Xiangyu Wang, Yilin Natl Univ Def Technol Changsha 410073 Hunan Peoples R China Natl Key Lab Parallel & Distributed Proc Changsha Peoples R China
graph embedding is a crucial method to produce node features that can be used for various machine learning tasks. Because of the large number of embedded parameters in large graphs, a single machine cannot load the en... 详细信息
来源: 评论
Low-Congestion Shortcuts for graphs Excluding Dense Minors  21
Low-Congestion Shortcuts for Graphs Excluding Dense Minors
收藏 引用
40th ACM SIGACT-SIGOPS Symposium on Principles of distributed Computing (PODC)
作者: Ghaffari, Mohsen Haeupler, Bernhard Swiss Fed Inst Technol Zurich Switzerland Carnegie Mellon Univ Pittsburgh PA 15213 USA
We prove that any n-node graph G with diameter D admits shortcuts with congestion O(delta D log n) and dilation O(delta D), where delta is the maximum edge-density of any minor of G. Our proof is simple and constructi... 详细信息
来源: 评论