The lexicographically first maximal subgraph problems:P-completeness andNC algorithms (Q4729355): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf02088292 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1498460077 / rank | |||
Normal rank | |||
Latest revision as of 08:55, 30 July 2024
scientific article; zbMATH DE number 4114014
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
