"On Enumerating Minimal Dicuts and Strongly Connected Subgraphs."

Leonid Khachiyan et al. (2008)

> Home

Details and statistics

DOI: 10.1007/S00453-007-9074-X

access: closed

type: Journal Article

metadata version: 2021-04-09

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/algorithmica/KhachiyanBEG08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/algorithmica/KhachiyanBEG08
Leonid Khachiyan, Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich:
On Enumerating Minimal Dicuts and Strongly Connected Subgraphs. Algorithmica 50(1): 159-172 (2008)

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.