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

Full description

Saved in:
Bibliographic Details
Published inComputer science review Vol. 45; p. 100490
Main Author Zehavi, Meirav
Format Journal Article
LanguageEnglish
Published Elsevier Inc 01.08.2022
Subjects
Crossing minimization
Graph Drawing
Kernelization
Parameterized algorithms
Parameterized Complexity
Parameterized Complexity
Graph Drawing
Crossing minimization
Parameterized algorithms
Kernelization
Online AccessGet full text
ISSN1574-0137
1876-7745
DOI10.1016/j.cosrev.2022.100490

Cover

More Information
Summary: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