ACM Home Page
Please provide us with feedback. Feedback
Computational complexity of compaction to cycles
Full text PdfPdf (221 KB)
Source Symposium on Discrete Algorithms archive
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms table of contents
Baltimore, Maryland, United States
Pages: 977 - 978  
Year of Publication: 1999
ISBN:0-89871-434-6
Author
Narayan Vikas  School of Computing Science, Simon Fraser University, Burnaby, British Columbia, Canada V5A 1S6
Sponsors
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIAM : Society for Industrial and Applied Mathematics
Publisher
Society for Industrial and Applied Mathematics  Philadelphia, PA, USA
Bibliometrics
Downloads (6 Weeks): 2,   Downloads (12 Months): 13,   Citation Count: 3
Additional Information:

cited by   index terms   collaborative colleagues  

Tools and Actions: Review this Article