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. 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
ArXivPDFHTML

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

3 / 3 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
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
26
5
0
10 Apr 2023
Fast Distributed Algorithms for Girth, Cycles and Small Subgraphs
Fast Distributed Algorithms for Girth, Cycles and Small Subgraphs
K. Censor-Hillel
Orr Fischer
T. Gonen
F. Gall
Dean Leitersdorf
R. Oshman
109
26
0
19 Jan 2021
1