Matching cut: kernelization, single-exponential time FPT, and exact exponential algorithms (Q2192064): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Created claim: Wikidata QID (P12): Q115577868, #quickstatements; #temporary_batch_1712272666262 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q115577868 / rank | |||
Normal rank | |||
Revision as of 01:13, 5 April 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Matching cut: kernelization, single-exponential time FPT, and exact exponential algorithms |
scientific article |
Statements
Matching cut: kernelization, single-exponential time FPT, and exact exponential algorithms (English)
0 references
29 June 2020
0 references
NP-hard problem
0 references
kernelization
0 references
branching algorithm
0 references
