|
|||||
|
|
On finding fundamental cut sets |
|
| Authors: | Sanjeev Saxena |
| Affiliation: | Dept. of Computer Science and Engineering, Indian Institute of Technology, Kanpur, India 208 016 |
| Abstract: | In this paper a linear time algorithm is proposed for preprocessing the edges of a graph. After preprocessing (in linear time), the fundamental cut set of any tree edge can be determined in time proportional to the size of that cut set. |
| Keywords: | Graph algorithms Fundamental cut sets Algorithms |
| 本文献已被 ScienceDirect 等数据库收录！ | |