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

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2205.14897
  4. Cited By
Fully Polynomial-Time Distributed Computation in Low-Treewidth Graphs

Fully Polynomial-Time Distributed Computation in Low-Treewidth Graphs

30 May 2022
Taisuke Izumi
Naoki Kitamura
Takamasa Naruse
Gregory Schwartzman
ArXiv (abs)PDFHTML

Papers citing "Fully Polynomial-Time Distributed Computation in Low-Treewidth Graphs"

2 / 2 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
90
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
58
5
0
10 Apr 2023
1