Parameterized complexity of fair deletion problems (Q2174554): Difference between revisions

From MaRDI portal
Changed label, description and/or aliases in en, and other parts
Merged Item from Q2988855
aliases / en / 0aliases / en / 0
 
Parameterized Complexity of Fair Deletion Problems
description / endescription / en
 
scientific article; zbMATH DE number 6721549
Property / title
 
Parameterized Complexity of Fair Deletion Problems (English)
Property / title: Parameterized Complexity of Fair Deletion Problems (English) / rank
 
Normal rank
Property / zbMATH Open document ID
 
Property / zbMATH Open document ID: 1485.68192 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/978-3-319-55911-7_45 / rank
 
Normal rank
Property / published in
 
Property / published in: Lecture Notes in Computer Science / rank
 
Normal rank
Property / publication date
 
19 May 2017
Timestamp+2017-05-19T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
Property / publication date: 19 May 2017 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68R10 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68W05 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6721549 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3195771200 / rank
 
Normal rank

Revision as of 08:44, 6 May 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
  • Parameterized Complexity of Fair Deletion Problems

Statements

Parameterized complexity of fair deletion problems (English)
0 references
Parameterized Complexity of Fair Deletion Problems (English)
0 references
0 references
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

Identifiers

0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references