Results 11 to 20 of about 7,486,633 (332)

A Survey on the k-Path Vertex Cover Problem

Axioms, 2022
Given an integer k ≥ 2, a k-path is a path on k vertices. A set of vertices in a graph G is called a k-path vertex cover if it includes at least one vertex of every k-path of G.
Jianhua Tu
doaj   +1 more source

Algorithm for Locating the Datum Strand of a Suspension Bridge Considering the Influence of Friction and the Change in Tangent Point of the Cable Saddle

Applied Sciences, 2022
In order to accurately simulate the position of the saddle in the analysis and calculation of a suspension bridge, and then obtain the accurate shape of the datum strand in the construction site, this paper puts forward a calculation method on the ...
Xiangong Zhou, Heng Han, Xiaobo Zheng, Yinghao Chen, Zhilei Liang   +4 more
doaj   +1 more source

Reducing the Computational Time for the Kemeny Method by Exploiting Condorcet Properties

Mathematics, 2021
Preference aggregation and in particular ranking aggregation are mainly studied by the field of social choice theory but extensively applied in a variety of contexts.
Noelia Rico, Camino R. Vela, Raúl Pérez-Fernández, Irene Díaz   +3 more
doaj   +1 more source

Exact Algorithms for Edge Domination [PDF]

Algorithmica, 2008
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
van Rooij, J.M.M., Bodlaender, H.L.
openaire   +6 more sources

Simple and Efficient Pattern Matching Algorithms for Biological Sequences

IEEE Access, 2020
The remarkable growth of biological data is a motivation to accelerate the discovery of solutions in many domains of computational bioinformatics. In different phases of the computational pipelines, pattern matching is a very practical operation.
Peyman Neamatollahi, Montassir Hadi, Mahmoud Naghibzadeh   +2 more
doaj   +1 more source

Multiplicatively Exact Algorithms for Transformation and Reconstruction of Directed Path-Cycle Graphs with Repeated Edges

Mathematics, 2021
For any weighted directed path-cycle graphs, a and b (referred to as structures), and any equal costs of operations (intermergings and duplication), we obtain an algorithm which, by successively applying these operations to a, outputs b if the first ...
Konstantin Gorbunov, Vassily Lyubetsky
doaj   +1 more source

Stability Analysis for the Modification Method Under the a Priori Strategy of the PTSP

IEEE Access, 2020
We propose in this paper a new formulation for the stability of the Traveling Salesman Problem (TSP) compared with its probabilistic version, the Probabilistic Traveling Salesman Problem (PTSP).
Mohamed Abdellahi Amar, Walid Khaznaji
doaj   +1 more source

An Exact Algorithm for Agile Earth Observation Satellite Scheduling with Time-Dependent Profits

Computers & Operations Research, 2020
The scheduling of an Agile Earth Observation Satellite (AEOS) consists of selecting and scheduling a subset of possible targets for observation in order to maximize the collected profit related to the images while satisfying its operational constraints ...
Guansheng Peng, Guopeng Song, Lining Xing, A. Gunawan, P. Vansteenwegen   +4 more
semanticscholar   +1 more source

An Exact Algorithm for Task Allocation of Multiple Unmanned Surface Vehicles with Minimum Task Time

Journal of Marine Science and Engineering, 2021
Task allocation of unmanned surface vehicles (USVs) with low task cost is an important research area which assigns USVs from starting points to different target points to complete tasks.
Kai Xue, Zhiqin Huang, Ping Wang, Zeyu Xu   +3 more
doaj   +1 more source

Exact Algorithms for Intervalizing Colored Graphs [PDF]

Theory of Computing Systems, 2011
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bodlaender, Hans L., van Rooij, Johan M M   +1 more
openaire   +6 more sources