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.
@inproceedings{ChandrasekharanH92,
title = {Efficient Algorithms for Computing Matching and Chromatic Polynominals on Series-Parallel Graphs},
author = {N. Chandrasekharan and Sridhar Hannenhalli},
year = {1992},
tags = {graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/ChandrasekharanH92},
cites = {0},
citedby = {0},
pages = {42-45},
booktitle = {Computing and Information - ICCI 92, Fourth International Conference on Computing and Information, Toronto, Ontario, Canada, May 28-30, 1992, Proceedings},
editor = {Waldemar W. Koczkodaj and Peter E. Lauer and Anestis A. Toptsis},
publisher = {IEEE Computer Society},
isbn = {0-8186-2812-X},
}