SIGN IN
SIGN UP
Finding hidden Hamiltonian cycles
Full Text:
PDF
Buy this Article
Authors:
Andrei Z. Broder
DEC Systems Research Center, Palo Alto, CA
Alan M. Frieze
Carnegie-Mellon Univ., Pittsburgh, PA
Eli Shamir
Hebrew Univ., Jerusalem, Israel
Published in:
· Proceeding
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Pages 182-189
ACM
New York, NY
, USA
©1991
table of contents
ISBN:0-89791-397-3
doi>
10.1145/103418.103442
1991 Article
Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 10
· Downloads (cumulative): 280
· Citation Count: 4
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
graph theory
sorting and searching
theory
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