"Minimum Cuts and Shortest Cycles in Directed Planar Graphs via Noncrossing ..."

Hung-Chun Liang, Hsueh-I Lu (2017)

> Home

Details and statistics

DOI: 10.1137/16M1057152

access: closed

type: Journal Article

metadata version: 2020-04-25

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/siamdm/LiangL17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/siamdm/LiangL17
Hung-Chun Liang, Hsueh-I Lu:
Minimum Cuts and Shortest Cycles in Directed Planar Graphs via Noncrossing Shortest Paths. SIAM J. Discret. Math. 31(1): 454-476 (2017)

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.