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. 1202.3205
  4. Cited By
Greedy Sequential Maximal Independent Set and Matching are Parallel on
  Average

Greedy Sequential Maximal Independent Set and Matching are Parallel on Average

15 February 2012
G. Blelloch
Jeremy T. Fineman
Julian Shun
ArXivPDFHTML

Papers citing "Greedy Sequential Maximal Independent Set and Matching are Parallel on Average"

1 / 1 papers shown
Title
Sleeping is Efficient: MIS in $O(1)$-rounds Node-averaged Awake
  Complexity
Sleeping is Efficient: MIS in O(1)O(1)O(1)-rounds Node-averaged Awake Complexity
Soumyottam Chatterjee
R. Gmyr
Gopal Pandurangan
43
32
0
12 Jun 2020
1