Combinatorial problems on series-parallel graphs |
| |
Authors: | K. Takamizawa T. Nishizeki N. Saito |
| |
Affiliation: | Dept. Electr. Communications, Faculty of Engineering, Tohoku University, Sendai, Japan 980 |
| |
Abstract: | This paper outlines the results and motivation of the paper [1], in which we showed, in a unified manner, that there exist linear time algorithms for many combinatorial problems defined on the class of series-parallel graphs. |
| |
Keywords: | |
本文献已被 ScienceDirect 等数据库收录! |
|