An optimal parallel solution for the path cover problem on \(P_{4}\)-sparse graphs (Q868040)
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: An optimal parallel solution for the path cover problem on Pā-sparse graphs |
scientific article; zbMATH DE number 5128129
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An optimal parallel solution for the path cover problem on \(P_{4}\)-sparse graphs |
scientific article; zbMATH DE number 5128129 |
Statements
An optimal parallel solution for the path cover problem on \(P_{4}\)-sparse graphs (English)
0 references
19 February 2007
0 references
\(P_{4}\)-sparse graphs
0 references
cographs
0 references
modular decomposition
0 references
parallel algorithms
0 references
path cover
0 references
0.8602789044380188
0 references
0.8234748244285583
0 references
0.8230003118515015
0 references
0.8099515438079834
0 references
0.7822265625
0 references
