A general method to speed up fixed-parameter-tractable algorithms (Q1607033): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
(5 intermediate revisions by 4 users not shown) | |||
Property / author | |||
Property / author: Rolf Niedermeier / rank | |||
Property / author | |||
Property / author: Rolf Niedermeier / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An improved fixed-parameter algorithm for vertex cover / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Advice classes of parametrized tractability / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4944990 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4850549 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4393480 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4263467 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4941917 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4251072 / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/s0020-0190(00)00004-1 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1972845596 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 11:39, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A general method to speed up fixed-parameter-tractable algorithms |
scientific article |
Statements
A general method to speed up fixed-parameter-tractable algorithms (English)
0 references
25 July 2002
0 references
fixed-parameter-tractable algorithm
0 references
FTP algorithm
0 references
time complexity
0 references