On the parameterized complexity of vertex cover and edge cover with connectivity constraints (Q482281): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q59864899, #quickstatements; #temporary_batch_1707252663060 |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 00:24, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the parameterized complexity of vertex cover and edge cover with connectivity constraints |
scientific article |
Statements
On the parameterized complexity of vertex cover and edge cover with connectivity constraints (English)
0 references
22 December 2014
0 references
parameterized complexity
0 references
connectivity problems
0 references
kernel lower bounds
0 references
vertex cover
0 references
edge cover
0 references
