"A deterministic near-linear time algorithm for finding minimum cuts in ..."

Parinya Chalermsook, Jittat Fakcharoenphol, Danupon Nanongkai (2004)

> Home

Details and statistics

DOI: —

access: closed

type: Conference or Workshop Paper

metadata version: 2012-12-07

- view
  - electronic edition @ acm.org
- export record
  dblp key:
  - conf/soda/ChalermsookFN04
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/soda/ChalermsookFN04
Parinya Chalermsook, Jittat Fakcharoenphol, Danupon Nanongkai:
A deterministic near-linear time algorithm for finding minimum cuts in planar graphs. SODA 2004: 828-829

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.