"A polynomial time algorithm to compute the connected treewidth of a ..."

Guillaume Mescoff, Christophe Paul, Dimitrios M. Thilikos (2022)

> Home

Details and statistics

DOI: 10.1016/J.DAM.2021.02.039

access: closed

type: Journal Article

metadata version: 2022-04-29

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/dam/MescoffPT22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dam/MescoffPT22
Guillaume Mescoff, Christophe Paul, Dimitrios M. Thilikos:
A polynomial time algorithm to compute the connected treewidth of a series-parallel graph. Discret. Appl. Math. 312: 72-85 (2022)

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.