Computational complexity and bounds for neighbor-scattering number of graphs - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Fengwei Li, Xueliang Li. Computational complexity and bounds for neighbor-scattering number of graphs. In 8th International Symposium on Parallel Architectures, Algorithms, and Networks, ISPAN 2005, December 7-9. 2005, Las Vegas, Nevada, USA. pages 478-483, IEEE Computer Society, 2005. [doi]

This author has not been identified. Look up 'Fengwei Li' in GoogleThis author has not been identified. Look up 'Xueliang Li' in Google

runs on WebDSL