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

From MaRDI portal
Added link to MaRDI item.
Created claim: Wikidata QID (P12): Q130971035, #quickstatements; #temporary_batch_1733738756918
 
(7 intermediate revisions by 5 users not shown)
aliases / en / 0aliases / en / 0
 
Lower Bounds for the Parameterized Complexity of Minimum Fill-in and Other Completion Problems
description / endescription / en
scientific article; zbMATH DE number 6903956
scientific article; zbMATH DE number 7342468
Property / author
 
Property / author: Ivan A. Bliznets / rank
Normal rank
 
Property / title
 
Lower Bounds for the Parameterized Complexity of Minimum Fill-in and Other Completion Problems (English)
Property / title: Lower Bounds for the Parameterized Complexity of Minimum Fill-in and Other Completion Problems (English) / rank
 
Normal rank
Property / zbMATH Open document ID
 
Property / zbMATH Open document ID: 1484.68152 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1145/3381426 / rank
 
Normal rank
Property / author
 
Property / author: Ivan A. Bliznets / rank
 
Normal rank
Property / published in
 
Property / published in: ACM Transactions on Algorithms / rank
 
Normal rank
Property / publication date
 
3 May 2021
Timestamp+2021-05-03T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
Property / publication date: 3 May 2021 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q27 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 7342468 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2228247117 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3011735201 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1508.05282 / rank
 
Normal rank
Property / zbMATH Keywords
 
graph-completion problems
Property / zbMATH Keywords: graph-completion problems / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q130971035 / rank
 
Normal rank

Latest revision as of 11:08, 9 December 2024

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

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
0 references
0 references
0 references
0 references
0 references
16 July 2018
0 references
3 May 2021
0 references
graph-completion problems
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
0 references