default search action

combined dblp search
author search
venue search
publication search

ask others

"On Algorithms Employing Treewidth for L-bounded Cut Problems."

Petr Kolman (2018)

> Home

Details and statistics

DOI: 10.7155/JGAA.00462

access: open

type: Journal Article

metadata version: 2022-12-07

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/jgaa/Kolman18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jgaa/Kolman18
Petr Kolman:
On Algorithms Employing Treewidth for L-bounded Cut Problems. J. Graph Algorithms Appl. 22(2): 177-191 (2018)

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.