"A fast algorithm for minimum weight odd circuits and cuts in planar graphs."

Adam N. Letchford, Nicholas A. Pearson (2005)

> Home

Details and statistics

DOI: 10.1016/J.ORL.2004.12.001

access: closed

type: Journal Article

metadata version: 2018-11-14

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/orl/LetchfordP05
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/orl/LetchfordP05
Adam N. Letchford, Nicholas A. Pearson:
A fast algorithm for minimum weight odd circuits and cuts in planar graphs. Oper. Res. Lett. 33(6): 625-628 (2005)

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.