The lexicographically first maximal subgraph problems:P-completeness andNC algorithms (Q4729355)
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: Publication:4729355 |
scientific article; zbMATH DE number 4114014
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The lexicographically first maximal subgraph problems:P-completeness andNC algorithms |
scientific article; zbMATH DE number 4114014 |
Statements
The lexicographically first maximal subgraph problems:P-completeness andNC algorithms (English)
0 references
1989
0 references
NC algorithms
0 references
P-completeness
0 references
lfm subgraph problem
0 references
0 references
0.8597193360328674
0 references
