ACM Symposium on Discrete Algorithms, SODA 2017


Article Details
Title: On Estimating Maximum Matching Size in Graph Streams
Article URLs:
Alternative Article URLs:
Authors: Sepehr Assadi
  • University of Pennsylvania, Department of Computer and Information Science
Sanjeev Khanna
  • University of Pennsylvania, Department of Computer and Information Science
Yang Li
  • University of Pennsylvania, Department of Computer and Information Science
Sharing: Unknown
Verification: Authors have not verified information
Artifact Evaluation Badge: none
Artifact URLs:
Artifact Correspondence Email Addresses:
NSF Award Numbers: 1116961, 1552909, 1617851, 1447470
DBLP Key: conf/soda/AssadiKL17
Author Comments:

Discuss this paper and its artifacts below