[HTML][HTML] Parameterized algorithms of fundamental NP-hard problems: a survey
Parameterized computation theory has developed rapidly over the last two decades. In
theoretical computer science, it has attracted considerable attention for its theoretical value …
theoretical computer science, it has attracted considerable attention for its theoretical value …
Planar disjoint paths, treewidth, and kernels
M Włodarczyk, M Zehavi - 2023 IEEE 64th Annual Symposium …, 2023 - ieeexplore.ieee.org
In the PLANAR DISJOINT PATHS problem, one is given an undirected planar graph with a
set of k vertex pairs \left(s_i,t_i\right) and the task is to find k pairwise vertex-disjoint paths …
set of k vertex pairs \left(s_i,t_i\right) and the task is to find k pairwise vertex-disjoint paths …
Page-sharing-based virtual machine packing with multi-resource constraints to reduce network traffic in migration for clouds
Virtual machine (VM) packing plays an important role in improving resource utilization in
cloud data centers. Recently, memory content similarity among VM instances has been used …
cloud data centers. Recently, memory content similarity among VM instances has been used …
Kernels for the disjoint paths problem on subclasses of chordal graphs
J Chaudhary, H Gahlawat, M Włodarczyk… - arXiv preprint arXiv …, 2023 - arxiv.org
Given an undirected graph $ G $ and a multiset of $ k $ terminal pairs $\mathcal {X} $, the
Vertex-Disjoint Paths (\VDP) and Edge-Disjoint Paths (\EDP) problems ask whether $ G …
Vertex-Disjoint Paths (\VDP) and Edge-Disjoint Paths (\EDP) problems ask whether $ G …
[PDF][PDF] A two-stage vehicle type recognition method combining the most effective Gabor features
W Sun, X Zhang, X He, Y Jin… - Computers, Materials & …, 2020 - cdn.techscience.cn
Vehicle type recognition (VTR) is an important research topic due to its significance in
intelligent transportation systems. However, recognizing vehicle type on the real-world …
intelligent transportation systems. However, recognizing vehicle type on the real-world …
On the parameterized complexity of minimum/maximum degree vertex deletion on several special graphs
J Li, W Li, Y Yang, X Yang - Frontiers of Computer Science, 2023 - Springer
In the minimum degree vertex deletion problem, we are given a graph, a distinguished
vertex in the graph, and an integer κ, and the question is whether we can delete at most κ …
vertex in the graph, and an integer κ, and the question is whether we can delete at most κ …