"On the negative cost girth problem in planar networks."

Matthew D. Williamson, K. Subramani (2015)

> Home

Details and statistics

DOI: 10.1016/J.JDA.2015.10.001

access: open

type: Journal Article

metadata version: 2024-02-09

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/jda/WilliamsonS15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jda/WilliamsonS15
Matthew D. Williamson, K. Subramani:
On the negative cost girth problem in planar networks. J. Discrete Algorithms 35: 40-50 (2015)

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.