"Computing Tree-Depth Faster Than 2ⁿ."

Fedor V. Fomin, Archontia C. Giannopoulou, Michal Pilipczuk (2015)

> Home

Details and statistics

DOI: 10.1007/S00453-014-9914-4

access: closed

type: Journal Article

metadata version: 2025-03-03

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/algorithmica/FominGP15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/algorithmica/FominGP15
Fedor V. Fomin, Archontia C. Giannopoulou, Michal Pilipczuk:
Computing Tree-Depth Faster Than 2ⁿ. Algorithmica 73(1): 202-216 (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.