Partitioning of the Minimum Essential Set Construction Problem (Q3903027): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0167-5060(08)70706-4 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W325006302 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 08:50, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Partitioning of the Minimum Essential Set Construction Problem |
scientific article |
Statements
Partitioning of the Minimum Essential Set Construction Problem (English)
0 references
1980
0 references
minimum essential set
0 references
minimum feedback vertex set
0 references
strongly connected directed graph
0 references
break vertex
0 references
NP-complete
0 references
strongly adjacent polygon
0 references
maximum stable set
0 references
essential set
0 references
reconstruction problem
0 references
