Generalized hypertree decompositions: NP-hardness and tractable variants

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Georg Gottlob Oxford University, Parks Road, Oxford
Zoltán Miklós École Polytechnique Fédérale de Lausanne, Switzerland
Thomas Schwentick Technische Universität Dortmund, Dortmund, Germany
Published in:
Cover Image
 
· Journal
Journal of the ACM (JACM) JACM Homepage archive
Volume 56 Issue 6, September 2009
Article No. 30
ACM New York, NY, USA
table of contents doi>10.1145/1568318.1568320
Generalized hypertree decompositions: NP-hardness and tractable variants Published by ACM 2009 Article
  • Research
  • Refereed
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 2
· Downloads (12 Months): 45
· Downloads (cumulative): 445
· Citation Count: 10


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