"Efficient Exact Algorithms on Planar Graphs: Exploiting Sphere Cut Branch ..."

Frederic Dorn et al. (2005)

> Home

Details and statistics

DOI: 10.1007/11561071_11

access: closed

type: Conference or Workshop Paper

metadata version: 2022-01-03

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/esa/DornPBF05
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/esa/DornPBF05
Frederic Dorn, Eelko Penninkx, Hans L. Bodlaender, Fedor V. Fomin:
Efficient Exact Algorithms on Planar Graphs: Exploiting Sphere Cut Branch Decompositions. ESA 2005: 95-106

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.