"Parameterized Complexity of the Spanning Tree Congestion Problem."

Hans L. Bodlaender et al. (2012)

> Home

Details and statistics

DOI: 10.1007/S00453-011-9565-7

access: open

type: Journal Article

metadata version: 2019-06-02

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/algorithmica/BodlaenderFGOL12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/algorithmica/BodlaenderFGOL12
Hans L. Bodlaender, Fedor V. Fomin, Petr A. Golovach, Yota Otachi, Erik Jan van Leeuwen:
Parameterized Complexity of the Spanning Tree Congestion Problem. Algorithmica 64(1): 85-111 (2012)

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.