Parameterized analysis and crossing minimization problems

In this survey/introductory article, we first present the basics of the field of Parameterized Complexity, made accessible to readers without background on the subject. Afterwards, we survey some central questions in Graph Drawing that concern the analysis of crossing minimization problems from the...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Computer science review Ročník 45; s. 100490
Hlavní autor: Zehavi, Meirav
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier Inc 01.08.2022
Témata:
Crossing minimization
Graph Drawing
Kernelization
Parameterized algorithms
Parameterized Complexity
Parameterized Complexity
Graph Drawing
Crossing minimization
Parameterized algorithms
Kernelization
ISSN:1574-0137, 1876-7745
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:In this survey/introductory article, we first present the basics of the field of Parameterized Complexity, made accessible to readers without background on the subject. Afterwards, we survey some central questions in Graph Drawing that concern the analysis of crossing minimization problems from the viewpoint of parameterized analysis, as well as put forward some of the remaining challenges. This article originated from an invited talk given at the 29th International Symposium on Graph Drawing and Network Visualization.
ISSN:1574-0137
1876-7745
DOI:10.1016/j.cosrev.2022.100490