Efficient Algorithms for Computing Matching and Chromatic Polynominals on Series-Parallel Graphs - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

N. Chandrasekharan, Sridhar Hannenhalli. Efficient Algorithms for Computing Matching and Chromatic Polynominals on Series-Parallel Graphs. In Waldemar W. Koczkodaj, Peter E. Lauer, Anestis A. Toptsis, editors, Computing and Information - ICCI 92, Fourth International Conference on Computing and Information, Toronto, Ontario, Canada, May 28-30, 1992, Proceedings. pages 42-45, IEEE Computer Society, 1992.

This author has not been identified. Look up 'N. Chandrasekharan' in GoogleThis author has not been identified. Look up 'Sridhar Hannenhalli' in Google

runs on WebDSL