"Optimal branch-decomposition of planar graphs in ..."

Qian-Ping Gu, Hisao Tamaki (2008)

> Home

Details and statistics

DOI: 10.1145/1367064.1367070

access: closed

type: Journal Article

metadata version: 2018-11-06

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/talg/GuT08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/talg/GuT08
Qian-Ping Gu, Hisao Tamaki:
Optimal branch-decomposition of planar graphs in O(n³) Time. ACM Trans. Algorithms 4(3): 30:1-30:13 (2008)

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.