"Enumerating Minimal Dicuts and Strongly Connected Subgraphs and Related ..."

Endre Boros et al. (2004)

> Home

Details and statistics

DOI: 10.1007/978-3-540-25960-2_12

access: closed

type: Conference or Workshop Paper

metadata version: 2021-04-09

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/ipco/BorosEGK04
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ipco/BorosEGK04
Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan:
Enumerating Minimal Dicuts and Strongly Connected Subgraphs and Related Geometric Problems. IPCO 2004: 152-162

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.