Max-tolerance graphs as intersection graphs: cliques, cycles, and recognition

Full Text: PdfPdf Buy this ArticleBuy this Article
Authors: Michael Kaufmann Universität Tübingen, WSI für Informatik, Tübingen, Germany
Jan Kratochvíl Charles University, Prague, Czech Republic
Katharina A. Lehmann
Amarendran R. Subramanian
Max-tolerance graphs as intersection graphs: cliques, cycles, and recognition Published by ACM 2006 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 1
· Downloads (12 Months): 20
· Downloads (cumulative): 266
· Citation Count: 6

Published in:
· Proceeding
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Pages 832 - 841
ACM New York, NY, USA ©2006
table of contents ISBN:0-89871-605-5 doi>10.1145/1109557.1109649

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