An efficient genetic algorithm for subgraph isomorphism

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Jaeun Choi Seoul National University, Seoul, South Korea
Yourim Yoon LG Electronics, Seoul, South Korea
Byung-Ro Moon Seoul National University, Seoul, South Korea
Published in:
Cover Image
 
· Proceeding
GECCO '12 Proceedings of the fourteenth international conference on Genetic and evolutionary computation conference
Pages 361-368
ACM New York, NY, USA ©2012
table of contents ISBN: 978-1-4503-1177-9 doi>10.1145/2330163.2330216
An efficient genetic algorithm for subgraph isomorphism Published by ACM 2012 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 7
· Downloads (12 Months): 131
· Downloads (cumulative): 131
· Citation Count: 0


Tools and Resources

Share:

|
feedback Feedback | Switch to single page view (no tabs)

Powered by The ACM Guide to Computing Literature


The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player
The ACM Guide to Computing Literature
All Tags
Export Formats
 
 
Save to Binder