SIGN IN
SIGN UP
Exploring unknown undirected graphs
Full Text:
PDF
Buy this Article
Authors:
Petrişor Panaite
Université du Québec à Hull
Andrzej Pelc
Université du Québec à Hull
Published in:
· Proceeding
SODA '98
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Pages 316-322
Society for Industrial and Applied Mathematics
Philadelphia, PA
, USA
©1998
table of contents
ISBN:0-89871-410-9
1998 Article
Bibliometrics
· Downloads (6 Weeks): 2
· Downloads (12 Months): 23
· Downloads (cumulative): 359
· Citation Count: 14
Tools and Resources
Buy this Article
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Tags:
algorithms
computations on discrete structures
design
general
heuristic methods
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