SIGN IN
SIGN UP
Generating random regular graphs
Full Text:
PDF
Buy this Article
Authors:
Jeong Han Kim
Microsoft Research, Redmond, WA
Van H. Vu
UCSD, La Jolla, CA
Published in:
· Proceeding
STOC '03
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Pages 213-222
ACM
New York, NY
, USA
©2003
table of contents
ISBN:1-58113-674-9
doi>
10.1145/780542.780576
2003 Article
Bibliometrics
· Downloads (6 Weeks): 8
· Downloads (12 Months): 51
· Downloads (cumulative): 846
· Citation Count: 7
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Upcoming Conference:
STOC'13
Share:
|
Tags:
algorithms
concentration
configuration model
graph theory
inequality
nonnumerical algorithms and problems
random regular graph
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder