Lower bounds for the parameterized complexity of Minimum Fill-In and other completion problems (Q4575659)

From MaRDI portal
Revision as of 11:08, 9 December 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q130971035, #quickstatements; #temporary_batch_1733738756918)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 7342468
  • Lower Bounds for the Parameterized Complexity of Minimum Fill-in and Other Completion Problems
Language Label Description Also known as
English
Lower bounds for the parameterized complexity of Minimum Fill-In and other completion problems
scientific article; zbMATH DE number 7342468
  • Lower Bounds for the Parameterized Complexity of Minimum Fill-in and Other Completion Problems

Statements

title
Lower bounds for the parameterized complexity of Minimum Fill-In and other completion problems (English)
0 references
Lower Bounds for the Parameterized Complexity of Minimum Fill-in and Other Completion Problems (English)
0 references
author
Marek Cygan
0 references
Paweł Komosa
0 references
Lukáš Mach
0 references
Michał Pilipczuk
0 references
Ivan A. Bliznets
0 references
publication date
16 July 2018
0 references
3 May 2021
0 references
zbMATH Keywords
graph-completion problems
0 references

Identifiers

zbMATH Open document ID
1410.68281
0 references
1484.68152
0 references
Mathematics Subject Classification ID
68R10
0 references
68Q17
0 references
68Q25
0 references
68Q27
0 references
zbMATH DE Number
6903956
0 references
7342468
0 references
OpenAlex ID
W2228247117
0 references
W3011735201
0 references
arXiv ID
1508.05282
0 references
Wikidata QID
Q130971035
0 references
 
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q4575659&oldid=38260171"
Powered by MediaWiki