On the complexity of the k-chain subgraph cover problem (Q1275070)
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: On the complexity of the k-chain subgraph cover problem |
scientific article; zbMATH DE number 1238799
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of the k-chain subgraph cover problem |
scientific article; zbMATH DE number 1238799 |
Statements
On the complexity of the k-chain subgraph cover problem (English)
0 references
12 January 1999
0 references
bipartite graph
0 references
comparability graph
0 references
convex bipartite graph
0 references
NC class
0 references
P class
0 references
parallel random access machine
0 references
0 references
0 references
0 references
0 references
0.8948037
0 references
0.89286435
0 references
0.8917205
0 references
0.8833971
0 references
0.8786887
0 references
