An optimal path cover algorithm for cographs (Q1903198)
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 path cover algorithm for cographs |
scientific article; zbMATH DE number 820316
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An optimal path cover algorithm for cographs |
scientific article; zbMATH DE number 820316 |
Statements
An optimal path cover algorithm for cographs (English)
0 references
26 November 1995
0 references
VLSI
0 references
Greedy algorithms
0 references
cographs
0 references
complement-reducible graphs
0 references
0.9588676
0 references
0.91382045
0 references
0.91285884
0 references
0.9064634
0 references
0.90063596
0 references
0.89690727
0 references
0.8954079
0 references
0.89538014
0 references
