咨询与建议

限定检索结果

文献类型

  • 44 篇 会议
  • 34 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

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

主题

  • 78 篇 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 篇 emek yuval
  • 3 篇 feuilloley laure...

语言

  • 77 篇 英文
  • 1 篇 其他
检索条件"主题词=Distributed Graph Algorithms"
78 条 记 录,以下是41-50 订阅
排序:
The sparsest additive spanner via multiple weighted BFS trees
收藏 引用
THEORETICAL COMPUTER SCIENCE 2020年 840卷 33-44页
作者: Censor-Hillel, Keren Paz, Ami Ravid, Noam Technion Dept Comp Sci Haifa Israel Univ Vienna Fac Comp Sci Vienna Austria
Spanners are fundamental graph structures that sparsify graphs at the cost of small stretch. In particular, in recent years, many sequential algorithms constructing additive all-pairs spanners were designed, providing... 详细信息
来源: 评论
The power of locality: Exploring the limits of randomness in distributed computing
收藏 引用
IT-INFORMATION TECHNOLOGY 2020年 第5-6期62卷 271-278页
作者: Maus, Yannic Israel Inst Technol Technion Haifa Israel
Many modern systems are built on top of large-scale networks like the Internet. This article provides an overview of a dissertation [29] that addresses the complexity of classic graph problems like the vertex coloring... 详细信息
来源: 评论
distributed Lower Bounds for Ruling Sets  61
Distributed Lower Bounds for Ruling Sets
收藏 引用
61st IEEE Annual Symposium on Foundations of Computer Science (FOCS)
作者: Balliu, Alkida Brandt, Sebastian Olivetti, Dennis Univ Freiburg Freiburg Germany Swiss Fed Inst Technol Zurich Switzerland
Given a graph G = (V, E), an (alpha, beta)-ruling set is a subset S subset of V such that the distance between any two vertices in S is at least alpha, and the distance between any vertex in V and the closest vertex i... 详细信息
来源: 评论
Network Decomposition and distributed Derandomization  27th
Network Decomposition and Distributed Derandomization
收藏 引用
27th International Colloquium on Structural Information and Communication Complexity (SIROCCO)
作者: Ghaffari, Mohsen Swiss Fed Inst Technol Zurich Switzerland
We overview a recent line of work [Rozho.n and Ghaffari at STOC 2020;Ghaffari, Harris, and Kuhn at FOCS 2018;and Ghaffari, Kuhn, and Maus at STOC 2017], which proved that any (locallycheckable) graph problem that admi... 详细信息
来源: 评论
distributed maximum matching verification in congest  34
Distributed maximum matching verification in congest
收藏 引用
34th International Symposium on distributed Computing, DISC 2020
作者: Ahmadi, Mohamad Kuhn, Fabian University of Freiburg Germany
We study the maximum cardinality matching problem in a standard distributed setting, where the nodes V of a given n-node network graph G = (V, E) communicate over the edges E in synchronous rounds. More specifically, ... 详细信息
来源: 评论
Compact distributed Certification of Planar graphs  20
Compact Distributed Certification of Planar Graphs
收藏 引用
39th Symposium on Principles of distributed Computing
作者: Feuilloley, Laurent Fraigniaud, Pierre Montealegre, Pedro Rapaport, Ivan Remila, Eric Todinca, Ioan Univ Chile Dept Ingn Ind Santiago Chile Univ Paris Paris France CNRS Paris France Univ Adolfo Ibanez Fac Ingn & Ciencias Santiago Chile Univ Chile DIM CMM UMI 2807 CNRS Santiago Chile UJM St Etienne GATE Lyon St Etienne CNRS UMR 5824 St Etienne France Univ dOrleans LIFO Orleans France INSA Ctr Val de Loire Blois Loir & Cher France
Naor, Parter, and Yogev (SODA 2020) have recently demonstrated the existence of a distributed interactive proof for planarity (i.e., for certifying that a network is planar), using a sophisticated generic technique fo... 详细信息
来源: 评论
Towards distributed two-stage stochastic optimization
收藏 引用
distributed COMPUTING 2025年
作者: Emek, Yuval Harlev, Noga Izumi, Taisuke Technion Israel Inst Technol Hefa Israel Univ Osaka Osaka Japan
The weighted vertex cover problem revolves around selecting a subset of vertices that covers a target edge set while minimizing the total cost of the selected vertices. We consider a variant of this classic optimizati... 详细信息
来源: 评论
Network Decomposition and distributed Derandomization  21
Network Decomposition and Distributed Derandomization
收藏 引用
Proceedings of the 22nd International Conference on distributed Computing and Networking
作者: Mohsen Ghaffari ETH Zurich Zurich Switzerland
This keynote talk will provide an overview of a recent line of work [Rozhoň and Ghaffari at STOC 2020; Ghaffari, Harris, and Kuhn at FOCS 2018; and Ghaffari, Kuhn, and Maus at STOC 2017], which presented the first ef... 详细信息
来源: 评论
MIDAS: Multilinear detection at scale
收藏 引用
JOURNAL OF PARALLEL AND distributed COMPUTING 2019年 132卷 363-382页
作者: Ekanayake, Saliya Cadena, Jose Wickramasinghe, Udayanga Vullikanti, Anil Lawrence Berkeley Natl Lab Performance & Algorithms Res PAR Grp Berkeley CA USA Lawrence Livermore Natl Lab Computat Engn Div Livermore CA 94550 USA Indiana Univ Dept Comp Sci Bloomington IN 47405 USA Univ Virginia Dept Comp Sci Charlottesville VA 22903 USA Univ Virginia Biocomplex Inst & Initiat Charlottesville VA 22903 USA
We focus on two classes of problems in graph mining: (1) finding trees and (2) anomaly detection in complex networks using scan statistics. These are fundamental problems in a broad class of applications. Most of the ... 详细信息
来源: 评论
distributed Exact Shortest Paths in Sublinear Time
收藏 引用
JOURNAL OF THE ACM 2020年 第3期67卷 15-15页
作者: Elkin, Michael Ben Gurion Univ Negev Dept Comp Sci POB 653 IL-84105 Beer Sheva Israel
The distributed single-source shortest paths problem is one of the most fundamental and central problems in the message-passing distributed computing. Classical Bellman-Ford algorithm solves it in O(n) time, where n i... 详细信息
来源: 评论