"A Faster FPT Algorithm for Finding Spanning Trees with Many Leaves."

Paul S. Bonsma, Tobias Brüggemann, Gerhard J. Woeginger (2003)

> Home

Details and statistics

DOI: 10.1007/978-3-540-45138-9_20

access: closed

type: Conference or Workshop Paper

metadata version: 2017-05-25

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/mfcs/BonsmaBW03
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/mfcs/BonsmaBW03
Paul S. Bonsma, Tobias Brüggemann, Gerhard J. Woeginger:
A Faster FPT Algorithm for Finding Spanning Trees with Many Leaves. MFCS 2003: 259-268

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.