ResearchTrend.AI
  • Communities
  • Connect sessions
  • AI calendar
  • Organizations
  • Join Slack
  • Contact Sales
Papers
Communities
Social Events
Terms and Conditions
Pricing
Contact Sales
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2026 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2102.08076
  4. Cited By
Deterministic CONGEST Algorithm for MDS on Bounded Arboricity Graphs
v1v2 (latest)

Deterministic CONGEST Algorithm for MDS on Bounded Arboricity Graphs

16 February 2021
S. A. Amiri
ArXiv (abs)PDFHTML

Papers citing "Deterministic CONGEST Algorithm for MDS on Bounded Arboricity Graphs"

1 / 1 papers shown
Near-Optimal Distributed Dominating Set in Bounded Arboricity Graphs
Near-Optimal Distributed Dominating Set in Bounded Arboricity GraphsACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), 2022
Michal Dory
M. Ghaffari
S. Ilchi
176
6
0
10 Jun 2022
1
Page 1 of 1