Several Graph problems and their Linear Program formulations

Seara, On the Steiner, geodetic and hull number of graphs, Discrete Math. Canoy, Jr., The Edge Steiner Number of a Graph, Bulletin of

The problem of deciding the existence of a SEPI from G to G’ is NP-complete, but show that when G is fixed, this problem can be decided in constant-time (hint: this

So the functions (p above represent stochastic versions of the harmonic morphisms, and we find it natural to call them stochastic harmonic morphisms. In Corollary 3 we prove that

A rough analysis sug- gests first to estimate the level sets of the probability density f (Polonik [16], Tsybakov [18], Cadre [3]), and then to evaluate the number of

L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des

Serratosa, A general model to define the substitu- tion, insertion and deletion graph edit costs based on an embedded space, Pattern Recognition Let- ters 138 (2020) 115 –

L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des

In Section 4, we will give an original explicit expression of the constant C (F, β). To this end, we recall in Section 3 results of Dwork [5], André [1] and of the author [10] on