Computing the pathwidth of directed graphs with small vertex cover (Q477674)
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: Computing the pathwidth of directed graphs with small vertex cover |
scientific article; zbMATH DE number 6378676
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing the pathwidth of directed graphs with small vertex cover |
scientific article; zbMATH DE number 6378676 |
Statements
Computing the pathwidth of directed graphs with small vertex cover (English)
0 references
9 December 2014
0 references
graph algorithms
0 references
fixed parameter tractable
0 references
pathwidth
0 references
vertex cover
0 references
vertex separation
0 references
0.8772266507148743
0 references
0.8761897087097168
0 references
0.8209046721458435
0 references
0.8157680630683899
0 references
