an extended star is a tree which has only one vertex with degree larger than two. the -center problem in a graph  asks to find a subset  of the vertices of  of cardinality  such that the maximum weighted distances from  to all vertices is minimized. in this paper we consider the -center problem on the unweighted extended stars, and present some properties to find solution.

An extended star is a tree which has only one vertex with degree larger than two. The -center problem in a graph  asks to find a subset  of the vertices of  of cardinality  such that the maximum weighted distances from  to all vertices is minimized. In this paper we consider the -center problem on the unweighted extended stars, and present some properties to find solution.

We continue the investigation proposed in [COCOA 2016, Weller, Chateau, Giroudeau, König and Pollet “On Residual Approximation in Solution Extension Problems”] about the study of extended problems. In this context, a partial feasible solution is given in advance and the goal is to extend this partial solution. In this paper, we focus on the edge-weighted spanning star forest problem for both mi...

This article presents a sensorless five level DTC control based on neural networks using Extended Kalman Filter (EKF) applied to Double Star Induction Machine (DSIM). The application of the DTC control brings a very interesting solution to the problems of robustness and dynamics. However, this control has some drawbacks such as the uncontrolled of the switching frequency and the strong ripple t...

In this paper we deal with two problems on star-shaped polygons. First, we present a Las-Vegas algorithm that uniformly at random creates a star-shaped polygon whose vertices are given by a point set S of n points in the plane that does not admit degenerate star-shaped polygons. The expected running time of the algorithm is O(n 2 logn) and it uses O(n) memory. We call a star-shaped polygon dege...