A short note on the complexity of computing strong pathbreadth (Q1705708): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 06:10, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A short note on the complexity of computing strong pathbreadth |
scientific article |
Statements
A short note on the complexity of computing strong pathbreadth (English)
0 references
16 March 2018
0 references
strong pathbreadth
0 references
path decomposition
0 references
acyclic clustering
0 references
graph theory
0 references
NP-completeness
0 references
computational complexity
0 references
