Home
Scholarly Works
Efficient Algorithms for Computing Matching and...
Conference

Efficient Algorithms for Computing Matching and Chromatic Polynominals on Series-Parallel Graphs.

Authors

Chandrasekharan N; Hannenhalli S

Editors

Koczkodaj WW; Lauer PE; Toptsis AA

Pagination

pp. 42-45

Publisher

IEEE Computer Society

Publication Date

January 1, 1992

ISBN-10

0-8186-2812-X

Conference proceedings

ICCI

Contact the Experts team