A polynomial-time tree decomposition to minimize congestion - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Chris Harrelson, Kirsten Hildrum, Satish Rao. A polynomial-time tree decomposition to minimize congestion. In SPAA 2003: Proceedings of the Fifteenth Annual ACM Symposium on Parallel Algorithms, June 7-9, 2003, San Diego, California, USA (part of FCRC 2003). pages 34-43, ACM, 2003. [doi]

This author has not been identified. Look up 'Chris Harrelson' in GoogleThis author has not been identified. Look up 'Kirsten Hildrum' in GoogleThis author has not been identified. Look up 'Satish Rao' in Google

runs on WebDSL