The 2-Terminal-Set Path Cover Problem and Its Polynomial Solution on Cographs (Q3507334)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5290803
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The 2-Terminal-Set Path Cover Problem and Its Polynomial Solution on Cographs |
scientific article; zbMATH DE number 5290803 |
Statements
The 2-Terminal-Set Path Cover Problem and Its Polynomial Solution on Cographs (English)
0 references
19 June 2008
0 references
path cover
0 references
fixed-endpoint path cover
0 references
perfect graphs
0 references
complement reducible graphs
0 references
cographs
0 references
linear-time algorithms
0 references
0 references
0 references
0.8650957942008972
0 references
0.8150397539138794
0 references
0.8019148111343384
0 references
0.8009909391403198
0 references
