SIGN IN
SIGN UP
The maximum degree of random planar graphs
Full Text:
PDF
Get this Article
Authors:
Michael Drmota
Technical University of Vienna
Omer Giménez
Google
Marc Noy
Universitat Politécnica de Catalunya, Barcelona
Konstantinos Panagiotou
Max Planck Institute for Informatics, Saarbrücken, Germany
Angelika Steger
Institute of Theoretical Computer Science, ETH Zürich
2012 Article
Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 11
· Downloads (cumulative): 152
· Citation Count: 1
Published in:
· Proceeding
SODA '12
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Pages 281-287
Society for Industrial and Applied Mathematics
Philadelphia, PA
, USA
©2012
table of contents
Tools and Resources
Buy this Article
Recommend the ACM DL
to your organization
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Author Tags
algorithms
design
design and analysis of algorithms
graph algorithms
graph enumeration
theory
Contact Us
|
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
**
Advertisements
Powered by
Did you know the ACM DL App is now available?
Did you know your Organization can subscribe to the ACM Digital Library?
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder