A short note on the complexity of computing strong pathbreadth (Q1705708): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.ipl.2018.01.005 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2791129715 / rank | |||
Normal rank | |||
Revision as of 22:04, 19 March 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
