Name
Playground
About
FAQ
GitHub
Playground
Shortest Path Finder
Community Detector
Connected Papers
Author Trending
Meher Preetam Korukonda
Claudia Calabrese
Timothy Miles-Board
Hao Mao
Peter Malec
Giovanni Venturelli
Chen Ma
Radu Timofte
Kuanrui Yin
Vinay Chande
Home
/
Paper
/
A Simple Proof of the O(sqrt(n log3/4 n) Upright Matching Bound
Paper Info
Open Visualization
Title
A Simple Proof of the O(sqrt(n log3/4 n) Upright Matching Bound
Year
DOI
Venue
1991
10.1137/0404005
SIAM J. Discrete Math.
DocType
Volume
Issue
Journal
4
1
Citations
PageRank
References
0
0.34
0
Authors
2
Authors (2 rows)
Cited by (0 rows)
References (0 rows)
Name
Order
Citations
PageRank
e g coffman
1
1158
379.75
Peter W. Shor
2
3821
574.60
1