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. 2304.04699
  4. Cited By
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

10 April 2023
Yi-Jun Chang
ArXivPDFHTML

Papers citing "Efficient Distributed Decomposition and Routing Algorithms in Minor-Free Networks and Their Applications"

4 / 4 papers shown
Title
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
54
1
0
12 Nov 2023
The Complexity of Distributed Approximation of Packing and Covering
  Integer Linear Programs
The Complexity of Distributed Approximation of Packing and Covering Integer Linear Programs
Yi-Jun Chang
Zeyong Li
35
4
0
02 May 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
37
10
0
17 May 2022
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
13
22
0
30 Jul 2021
1