"Complexity framework for forbidden subgraphs IV: The Steiner Forest problem."

Hans L. Bodlaender et al. (2025)

> Home

Details and statistics

DOI: 10.1016/J.JCSS.2025.103682

access: closed

type: Journal Article

metadata version: 2025-08-05

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jcss/BodlaenderJMOPPSL25
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jcss/BodlaenderJMOPPSL25
Hans L. Bodlaender, Matthew Johnson, Barnaby Martin, Jelle J. Oostveen, Sukanya Pandey, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen:
Complexity framework for forbidden subgraphs IV: The Steiner Forest problem. J. Comput. Syst. Sci. 154: 103682 (2025)

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.