An Algorithm to Enumerate All Cutsets of a Graph in Linear Time per Cutset

@article{Tsukiyama1980AnAT,
  title={An Algorithm to Enumerate All Cutsets of a Graph in Linear Time per Cutset},
  author={Shuji Tsukiyama and Isao Shirakawa and Hiroshi Ozaki and Hiromu Ariyoshi},
  journal={J. ACM},
  year={1980},
  volume={27},
  pages={619-632}
}
Thts paper deals wRh the problem of enumerating all the cutsets or all the s-t cutsets separatmg two spectfied verttces s and t m an undirected graph A vanety of approaches have been proposed for this problem, among which one based on the partmon e ra set of veruces rote two sets is the most effi¢ienL It is first shown that an algorithm of this type has time complexity O((n + m)(n log2#)#), and two new algorithms with ume complexity O((n + m)O + I)) are then proposed One of these new algorithms… CONTINUE READING

From This Paper

Figures, tables, results, connections, and topics extracted from this paper.
47 Extracted Citations
0 Extracted References
Similar Papers

Citing Papers

Publications influenced by this paper.
Showing 1-10 of 47 extracted citations

Similar Papers

Loading similar papers…