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

Bibliographic Details

Published in:	Computer science review Vol. 45; p. 100490
Main Author:	Zehavi, Meirav
Format:	Journal Article
Language:	English
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
ISSN:	1574-0137, 1876-7745
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!