On the complexity of the k-chain subgraph cover problem (Q1275070)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of the k-chain subgraph cover problem |
scientific article |
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
