Communications of the ACM, volume 67, issue 4, pages 70-79
Fast Parameterized Preprocessing for Polynomial-Time Solvable Graph Problems
Anne-Sophie Himmel
1
,
George B. Mertzios
2
,
André Nichterlein
1
,
Rolf Niedermeier
1
Publication type: Journal Article
Publication date: 2024-03-25
Journal:
Communications of the ACM
scimago Q1
SJR: 2.957
CiteScore: 16.1
Impact factor: 11.1
ISSN: 00010782, 15577317
DOI:
10.1145/3624713
General Computer Science
Abstract
The challenge of transforming polynomial-time algorithms to really efficient ones.
Found
Are you a researcher?
Create a profile to get free access to personal recommendations for colleagues and new articles.