Parameterized complexity of fair deletion problems (Q2174554): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Nonserial dynamic programming / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the complexity of some colorful problems parameterized by treewidth / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Elements of finite model theory. / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Fair edge deletion problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Parameterized complexity of fair deletion problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Sparsity. Graphs, structures, and algorithms / rank | |||
Normal rank | |||
Revision as of 10:26, 22 July 2024
scientific article; zbMATH DE number 6721549
- Parameterized Complexity of Fair Deletion Problems
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Parameterized complexity of fair deletion problems |
scientific article; zbMATH DE number 6721549 |
|
Statements
Parameterized complexity of fair deletion problems (English)
0 references
Parameterized Complexity of Fair Deletion Problems (English)
0 references
21 April 2020
0 references
19 May 2017
0 references
parameterized complexity
0 references
fair problems
0 references
metatheorems
0 references
tree-depth
0 references
vertex cover
0 references
neighborhood diversity
0 references
0 references
