Review articleParameterized analysis and crossing minimization problems☆
Section snippets
Background on parameterized complexity
Towards the introduction of some basic concepts in Parameterized Complexity, let us start with an example. In (the classic parameterized version of) the Vertex Cover problem, we are given an undirected graph and a non-negative integer . The objective is to determine whether has a vertex cover—that is, a subset of vertices such that for every edge , —of size at most . While the Vertex Cover problem is NP-hard, we may still desire to solve it. A natural way to
The classic crossing number problem
In the last few years, there has been a substantial increase in the number of works at the intersection of Parameterized Complexity and Graph Drawing—specifically, problems in graph drawing studied from the perspective of parameterized analysis. For a few illustrative examples, let us mention that this includes studies of crossing minimization (on which we elaborate below), recognition of planar graph families such as upward planarity testing [40], [41] and grid graph recognition [42], as well
Restricted embeddings
Over the years, several restricted variants of the Crossing Number problem where drawings must have some particular form have been introduced and studied. Here, we consider three such prominent restrictions that are of interest from the viewpoint of Parameterized Complexity.
Fixed point sets/embeddings: Computation of subgraphs with few crossings and related variants
Settings where we are given a set of points P in the plane that represent vertices, and edges are to be drawn as straight lines between them, are intensively studied since the early 80s. A large body of works has been devoted to the establishment of combinatorial bounds on the number of crossing-free graphs on P, where particular attention is given to crossing-free triangulations, perfect matchings and Hamiltonian paths and cycles. Originally, the study of these bounds was initiated by Newborn
Testing -planarity and related variants
A -planar graph is a graph that admits a plane drawing where every edge is crossed at most times. Notice that in the last paragraph of Section 3.2, we have considered a notion similar to that of a -planar graph, where the drawing was restricted to be a book embedding. Testing even -planarity (where given a graph , we need to decide whether it is -planar) is NP-hard [135], [136], even when restricted to almost-planar graphs [55], or to graphs of bounded (by a constant) bandwidth [43]
Crossing number as a parameter
So far, we have discussed only the computation of drawings of graphs—or the computation of subgraphs of already drawn graphs—that have few crossings. In most cases, the crossing number (or variant of it) has been part of the parameterization. However, to date, various other computational problems have been already studied on graphs with few crossings. For example, Grigoriev and Bodlaender [135] considered graphs that can be embedded on a surface of bounded genus such that each edge has a
Variants of crossing number as a measure
Over the years, a wide-variety of notions based on the crossing number have been introduced and extensively studied. Here, we survey a few of them, with emphasis on the perspective of Parameterized Complexity.
Odd Crossing Number. The odd crossing number is defined similarly to the crossing number, or, even more similarly, to the pairwise crossing number, but it only counts pairs of distinct edges that intersect in an odd number of points. The computation of the odd crossing number of a given
Conclusion
The main purpose of this article has been to provide a survey of the current state-of-the-art of the study of crossing minimization problems from the viewpoint of Parameterized Complexity, with emphasis on: (1) attraction of researchers outside the Parameterized Complexity community to consider the perspective of parameterized analysis in the study of graph drawing problems, by the inclusion of a gentle introduction to the area of Parameterized Complexity; and, in particular, (2) suggestion of
Declaration of Competing Interest
The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.
References (159)
- et al.
Improved upper bounds for vertex cover
Theoret. Comput. Sci.
(2010) - et al.
Vertex cover: Further observations and further improvements
J. Algorithms
(2001) - et al.
Narrow sieves for parameterized paths and packings
J. Comput. System Sci.
(2017) Graph rewriting: An algebraic and logic approach
- et al.
Obtaining split graphs by edge contraction
Theoret. Comput. Sci.
(2015) - et al.
Edge dominating set and colorings on graphs with fixed clique-width
Discrete Appl. Math.
(2003) - et al.
Advice classes of parameterized tractability
Ann. Pure Appl. Logic
(1997) - et al.
On problems without polynomial kernels
J. Comput. System Sci.
(2009) - et al.
Which crossing number is it anyway?
J. Combin. Theory Ser. B
(2000) Crossing number is hard for cubic graphs
J. Combin. Theory Ser. B
(2006)
Computing crossing numbers in quadratic time
J. Comput. System Sci.
A practical approach to courcelle’s theorem
Electron. Notes Theor. Comput. Sci.
The crossing number of a projective graph is quadratic in the face-width
Electron. Notes Discrete Math.
Toroidal grid minors and stretch in embedded graphs
J. Comb. Theory B
Drawing graphs in two layers
Theoret. Comput. Sci.
A faster fixed parameter algorithm for two-layer crossing minimization
Inform. Process. Lett.
A linear edge kernel for two-layer crossing minimization
Theoret. Comput. Sci.
Fixed parameter algorithms for one-sided crossing minimization revisited
J. Discrete Algorithms
Embedding planar graphs in four pages
J. Comput. System Sci.
The book thickness of a graph
J. Combin. Theory Ser. B
Data Structures and Algorithms 2: Graph Algorithms and NP-Completeness, vol. 2
Nondeterminism within P
SIAM J. Comput.
Fundamentals of Parameterized Complexity, vol. 4
Planar 3-colorability is polynomial complete
ACM Sigact News
Parameterized Algorithms
Color-coding
J. ACM
Mixing color coding-related techniques
(Meta) kernelization
J. ACM
Maximum minimal vertex cover parameterized by vertex cover
SIAM J. Discrete Math.
Data reduction and exact algorithms for clique cover
ACM J. Exp. Algorithmics
Known algorithms for edge clique cover are probably optimal
SIAM J. Comput.
Split contraction: The untold story
ACM Trans. Comput. Theory
Clique-width III: Hamiltonian cycle and the odd case of graph coloring
ACM Trans. Algorithms
Kernelization of packing problems
Weak compositions and their applications to polynomial lower bounds for kernelization
Kernelization: theory of Parameterized Preprocessing
Invitation to Fixed-Parameter Algorithms, vol. 31
Cognition and Intractability: a Guide to Classical and Parameterized Complexity Analysis
Parameterized complexity of geometric problems
Comput. J.
Parameterized algorithms in bioinformatics: An overview
Algorithms
Matrix rigidity from the viewpoint of parameterized complexity
SIAM J. Discrete Math.
Parameterized algorithmics for computational social choice: Nine research challenges
Tsinghua Sci. Technol.
Parameterized complexity for the database theorist
ACM SIGMOD Rec.
A survey on approximation in parameterized complexity: Hardness and algorithms
Algorithms
Cited by (5)
A fast path relinking algorithm for the min–max edge crossing problem
2024, Computers and Operations ResearchA survey of parameterized algorithms and the complexity of edge modification
2023, Computer Science ReviewDrawn Tree Decomposition: New Approach for Graph Drawing Problems
2023, Leibniz International Proceedings in Informatics, LIPIcs