SIGN IN
SIGN UP
Some novel locality results for the blob code spanning tree representation
Full Text:
PDF
Buy this Article
Authors:
Tim Paulden
University of Exeter
David K. Smith
University of Exeter
Published in:
· Proceeding
GECCO '07
Proceedings of the 9th annual conference on Genetic and evolutionary computation
ACM
New York, NY
, USA
©2007
table of contents
ISBN: 978-1-59593-697-4
doi>
10.1145/1276958.1277207
2007 Article
Bibliometrics
· Downloads (6 Weeks): 2
· Downloads (12 Months): 2
· Citation Count: 0
Tools and Resources
Buy this Article
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Upcoming Conference:
GECCO '12
Share:
|
Tags:
algorithms
arrays
coding
combinatorial algorithms
computations on discrete structures
encoding
graph algorithms
graphs and networks
locality
representation
spanning tree
theory
trees
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