Parallelizing an algorithm to decide if a bipartite graph is shellable - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Andres Galvis, Roberto Cruz, John W. Branch, Christian Trefftz. Parallelizing an algorithm to decide if a bipartite graph is shellable. In IEEE International Conference on Electro-Information Technology , EIT 2013, Rapid City, SD, USA, May 9-11, 2013. pages 1-3, IEEE, 2013. [doi]

This author has not been identified. Look up 'Andres Galvis' in GoogleThis author has not been identified. Look up 'Roberto Cruz' in GoogleThis author has not been identified. Look up 'John W. Branch' in GoogleThis author has not been identified. Look up 'Christian Trefftz' in Google

runs on WebDSL