Lower Bounds for the Parameterized Complexity of Minimum Fill-in and Other Completion Problems.

Saved in:

Bibliographic Details
Title:	Lower Bounds for the Parameterized Complexity of Minimum Fill-in and Other Completion Problems.
Authors:	BLIZNETS, IVAN¹, CYGAN, MAREK², KOMOSA, PAWEŁ³, PILIPCZUK, MICHAŁ¹, MACH, LUKÁŠ¹
Source:	ACM Transactions on Algorithms; Mar2020, Vol. 16 Issue 2, p1-31, 31p
Database:	Applied Science & Technology Source

Description
ISSN:	15496325
DOI:	10.1145/3381426