An efficient algorithm for the configuration problem of dominance graphs

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Ernst Althaus Max-Planck-Institute for Computer Science, Saarbrücken, Germany
Denys Duchier programming Systems Lab, Fachbereich Informatik, Universität des Saarlandes, Saarbrücken, Germany
Alexander Koller Department of Computational Linguistics, Universität des Saarlandes, Saarbrücken, Germany
Kurt Mehlhorn Max-Planck-Institute for Computer Science, Saarbrücken, Germany
Joachim Niehren programming Systems Lab, Fachbereich Informatik, Universität des Saarlandes, Saarbrücken, Germany
Sven Thiel Max-Planck-Institute for Computer Science, Saarbrücken, Germany
An efficient algorithm for the configuration problem of dominance graphs 2001 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 11
· Downloads (cumulative): 197
· Citation Count: 4

Published in:
· Proceeding
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Pages 815-824
Society for Industrial and Applied Mathematics Philadelphia, PA, USA ©2001
table of contents ISBN:0-89871-490-7

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