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

A Subquadratic-Time Distributed Algorithm for Exact Maximum Matching

25 April 2021
Naoki Kitamura
Taisuke Izumi
ArXivPDFHTML

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

4 / 4 papers shown
Title
The Message Complexity of Distributed Graph Optimization
The Message Complexity of Distributed Graph Optimization
Fabien Dufoulon
Shreyas Pai
Gopal Pandurangan
Sriram V. Pemmaraju
Peter Robinson
22
6
0
24 Nov 2023
A Nearly Linear-Time Distributed Algorithm for Exact Maximum Matching
A Nearly Linear-Time Distributed Algorithm for Exact Maximum Matching
Taisuke Izumi
Naoki Kitamura
Yutaro Yamaguchi
17
0
0
07 Nov 2023
Reducing Maximum Weighted Matching to the Largest Cardinality Matching
  in CONGEST
Reducing Maximum Weighted Matching to the Largest Cardinality Matching in CONGEST
V. Mkrtchyan
20
0
0
03 Jan 2023
Fully Polynomial-Time Distributed Computation in Low-Treewidth Graphs
Fully Polynomial-Time Distributed Computation in Low-Treewidth Graphs
Taisuke Izumi
Naoki Kitamura
Takamasa Naruse
Gregory Schwartzman
12
5
0
30 May 2022
1