This paper deals with a variant of the traveling salesman problem (TSP), called the multiple
Steiner TSP with order constraints. This consists, given an undirected graph with …

In this article we consider the Directed Steiner Path Cover problem on directed co-graphs.
Given a directed graph G=(V, E) G=(V, E) and a set T ⊆ VT⊆ V of so-called terminal …

研究单位区间图上的半配对多对多k-不相交路覆盖(k-disjoint path coverꎬ k-DPC)
的容错性问题ꎬ 利用路覆盖的结构特点ꎬ 结合单位区间图顶点序的结构性质ꎬ 刻画具有半配对1 …

A set of vertices X of a graph G is a strong edge geodetic set if, to any pair of vertices from X,
we can assign one (or zero) shortest path between them, such that every edge of G is …

The Steiner path problem is a restriction of the well known Steiner tree problem such that the
required terminal vertices lie on a path of minimum cost. While a Steiner tree always exists …