Showing results for The Parameterized Complexity of the Segment Number.
Search instead for The Parametrized Complexity of the Segment Number.
Aug 29, 2023 · We study the problem of computing the segment number from the perspective of parameterized complexity. We show that this problem is fixed-parameter tractable.
Jul 2, 2024 · This paper focuses on the parametrized complexity of computing the segment number of a graph. A decision problem with input x and parameter k ∈ ...
Jan 6, 2024 · Given a planar graph G, the segment number of G is the minimum number of segments that can be achieved by any planar straight-line drawing of G.
Aug 29, 2023 · We study the problem of computing the segment number from the perspective of parameterized complexity. We show that this problem is fixed- ...
We study the problem of computing the segment number from the perspective of parameterized complexity. We show that this problem is fixed-parameter ...
Given a planar graph G, the segment number of G is the minimum number of segments that can be achieved by any planar straight-line drawing of G. The line cover ...
The Parametrized Complexity of the Segment Number ... Authors: Sabine Cornelsen; Giordano Da Lozzo; Luca Grilli; Siddharth Gupta; Jan Kratochvíl; Alexander Wolff ...
We study the NP-complete Minimum Shared Edges (MSE) problem, defined as follows. Given an undirected graph, a source and a sink vertex, and two integers p ...
Abstract. The odd crossing number of G is the smallest number of pairs of edges that cross an odd number of times in any drawing of G. We.
The goal is to find a center haplotype segment s of length L and split each genotype segment gi ∈ D ∪ N into a pair (hi,1,hi,2) of haplotype segments so that. ( ...