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

Shuji Tsukiyama et al. (1980)

> Home

Details and statistics

DOI: 10.1145/322217.322220

access: closed

type: Journal Article

metadata version: 2018-11-06

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jacm/TsukiyamaSOA80
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jacm/TsukiyamaSOA80
Shuji Tsukiyama, Isao Shirakawa, Hiroshi Ozaki, Hiromu Ariyoshi:
An Algorithm to Enumerate All Cutsets of a Graph in Linear Time per Cutset. J. ACM 27(4): 619-632 (1980)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.