ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2008.03091
  4. Cited By
Low-Congestion Shortcuts for Graphs Excluding Dense Minors

Low-Congestion Shortcuts for Graphs Excluding Dense Minors

7 August 2020
M. Ghaffari
Bernhard Haeupler
ArXiv (abs)PDFHTML

Papers citing "Low-Congestion Shortcuts for Graphs Excluding Dense Minors"

12 / 12 papers shown
Title
Decentralized Distributed Graph Coloring II: degree+1-Coloring Virtual
  Graphs
Decentralized Distributed Graph Coloring II: degree+1-Coloring Virtual Graphs
Maxime Flin
Magnús M. Halldórsson
Alexandre Nolin
63
2
0
20 Aug 2024
Model-Agnostic Approximation of Constrained Forest Problems
Model-Agnostic Approximation of Constrained Forest Problems
Corinna Coupette
Alipasha Montaseri
Christoph Lenzen
27
0
0
14 Jul 2024
Fast Broadcast in Highly Connected Networks
Fast Broadcast in Highly Connected Networks
Shashwat Chandra
Yi-Jun Chang
Michal Dory
Mohsen Ghaffari
Dean Leitersdorf
48
1
0
19 Apr 2024
Polylog-Competitive Deterministic Local Routing and Scheduling
Polylog-Competitive Deterministic Local Routing and Scheduling
Bernhard Haeupler
Shyamal Patel
Antti Roeyskoe
Cliff Stein
Goran Zuzic
54
1
0
12 Mar 2024
The Distributed Complexity of Locally Checkable Labeling Problems Beyond
  Paths and Trees
The Distributed Complexity of Locally Checkable Labeling Problems Beyond Paths and Trees
Yi-Jun Chang
71
2
0
12 Nov 2023
Efficient Distributed Decomposition and Routing Algorithms in Minor-Free
  Networks and Their Applications
Efficient Distributed Decomposition and Routing Algorithms in Minor-Free Networks and Their Applications
Yi-Jun Chang
43
5
0
10 Apr 2023
Narrowing the LOCAL$\unicode{x2013}$CONGEST Gaps in Sparse Networks via
  Expander Decompositions
Narrowing the LOCAL\unicodex2013\unicode{x2013}\unicodex2013CONGEST Gaps in Sparse Networks via Expander Decompositions
Yi-Jun Chang
Hsin-Hao Su
92
10
0
17 May 2022
Undirected $(1+\varepsilon)$-Shortest Paths via Minor-Aggregates:
  Near-Optimal Deterministic Parallel & Distributed Algorithms
Undirected (1+ε)(1+\varepsilon)(1+ε)-Shortest Paths via Minor-Aggregates: Near-Optimal Deterministic Parallel & Distributed Algorithms
Václav Rozhon
Christoph Grunau
Bernhard Haeupler
Goran Zuzic
Jason Li
51
29
0
12 Apr 2022
Almost Universally Optimal Distributed Laplacian Solvers via
  Low-Congestion Shortcuts
Almost Universally Optimal Distributed Laplacian Solvers via Low-Congestion Shortcuts
Ioannis Anagnostides
Christoph Lenzen
Bernhard Haeupler
Goran Zuzic
Themis Gouleakis
55
8
0
11 Sep 2021
Local certification of graph decompositions and applications to
  minor-free classes
Local certification of graph decompositions and applications to minor-free classes
Nicolas Bousquet
Laurent Feuilloley
Théo Pierron
57
23
0
30 Jul 2021
Low-Congestion Shortcuts in Constant Diameter Graphs
Low-Congestion Shortcuts in Constant Diameter Graphs
Shimon Kogan
M. Parter
28
11
0
03 Jun 2021
The Energy Complexity of Diameter and Minimum Cut Computation in
  Bounded-Genus Networks
The Energy Complexity of Diameter and Minimum Cut Computation in Bounded-Genus Networks
Yi-Jun Chang
45
3
0
10 May 2018
1