"Efficient Algorithms for k-Terminal Cuts on Planar Graphs."

Danny Z. Chen, Xiaodong Wu (2004)

> Home

Details and statistics

DOI: 10.1007/S00453-003-1061-2

access: closed

type: Journal Article

metadata version: 2021-02-26

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/algorithmica/ChenW03
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/algorithmica/ChenW03
Danny Z. Chen, Xiaodong Wu:
Efficient Algorithms for k-Terminal Cuts on Planar Graphs. Algorithmica 38(2): 299-316 (2004)

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.