SIGN IN
SIGN UP
Small universal graphs
Full Text:
PDF
Buy this Article
Authors:
M. R. Capalbo
Department of Mathematical Sciences, The Johns Hopkins University, 3400 N. Charles Street, Baltimore, MD
S. R. Kosaraju
Department of Computer Science, The Johns Hopkins University, 3400 N. Charles Street, Baltimore, MD
Published in:
· Proceeding
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Pages 741-749
ACM
New York, NY
, USA
©1999
table of contents
ISBN:1-58113-067-8
doi>
10.1145/301250.301446
1999 Article
Bibliometrics
· Downloads (6 Weeks): 1
· Downloads (12 Months): 6
· Downloads (cumulative): 175
· Citation Count: 8
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Upcoming Conference:
STOC '14
Share:
|
Tags:
algorithms
computations on discrete structures
design
general
performance
theory
verification
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