Fast Parameterized Preprocessing for Polynomial-Time Solvable Graph Problems.
In: Communications of the ACM, Jg. 67 (2024-04-01), Heft 4, S. 70-79
serialPeriodical
Zugriff:
This article examines the angle of parameterized preprocessing to overcome complexity barriers for polynomial-time solvable problems. Three concepts of parameterized preprocessing are explored in detail in this research- parameterized size reduction, parameterized structure simplification, and parameterized data structure design.
Titel: |
Fast Parameterized Preprocessing for Polynomial-Time Solvable Graph Problems.
|
---|---|
Autor/in / Beteiligte Person: | Himmel, Anne-Sophie ; Mertzios, George B. ; Nichterlein, André ; Niedermeier, Rolf |
Zeitschrift: | Communications of the ACM, Jg. 67 (2024-04-01), Heft 4, S. 70-79 |
Veröffentlichung: | 2024 |
Medientyp: | serialPeriodical |
ISSN: | 0001-0782 (print) |
DOI: | 10.1145/3624713 |
Schlagwort: |
|
Sonstiges: |
|