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...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Computer science review Jg. 45; S. 100490
1. Verfasser: Zehavi, Meirav
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Elsevier Inc 01.08.2022
Schlagworte:
Crossing minimization
Graph Drawing
Kernelization
Parameterized algorithms
Parameterized Complexity
Parameterized Complexity
Graph Drawing
Crossing minimization
Parameterized algorithms
Kernelization
ISSN:1574-0137, 1876-7745
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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