A short note on the complexity of computing strong pathbreadth (Q1705708)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A short note on the complexity of computing strong pathbreadth |
scientific article; zbMATH DE number 6851040
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A short note on the complexity of computing strong pathbreadth |
scientific article; zbMATH DE number 6851040 |
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
0 references
0 references
0.87230253
0 references
0.86690867
0 references
0.86622095
0 references
0.8631547
0 references
0.8620463
0 references
0.86153126
0 references
