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. 2311.04140
  4. Cited By
A Nearly Linear-Time Distributed Algorithm for Exact Maximum Matching

A Nearly Linear-Time Distributed Algorithm for Exact Maximum Matching

7 November 2023
Taisuke Izumi
Naoki Kitamura
Yutaro Yamaguchi
ArXivPDFHTML

Papers citing "A Nearly Linear-Time Distributed Algorithm for Exact Maximum Matching"

1 / 1 papers shown
Title
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
34
10
0
17 May 2022
1