Generating all maximal independent sets of bounded-degree hypergraphs

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Nina Mishra Computer Science Department, University of Illinois at Urbana-Champaign, Urbana, IL
Leonard Pitt Computer Science Department, University of Illinois at Urbana-Champaign, Urbana, IL
Published in:
· Proceeding
COLT '97 Proceedings of the tenth annual conference on Computational learning theory
Pages 211-217
ACM New York, NY, USA ©1997
table of contents ISBN:0-89791-891-6 doi>10.1145/267460.267500
Generating all maximal independent sets of bounded-degree hypergraphs Published by ACM 1997 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 1
· Downloads (12 Months): 9
· Downloads (cumulative): 399
· Citation Count: 13


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