• Aucun résultat trouvé

A polyhedral approach to locating-dominating sets in graphs

N/A
N/A
Protected

Academic year: 2021

Partager "A polyhedral approach to locating-dominating sets in graphs"

Copied!
7
0
0

Texte intégral

Loading

Références

Documents relatifs

By taking a cursory outlook on the regional planning in Japan from Meiji Era to the present time were possible to construct a full picture regarding the influence major

The error pattern due to the neglect of the ozone depen- dent contribution to the Ring effect as a function of solar zenith angle, total ozone, and effective height is summarised

This antiallodynic effect was long-lasting (between 4 and 24 h) and more prolonged than that of inverse agonists, suggesting the involve- ment of additional (5-HT

To prove Theorem 1.3 and Theorem 1.4 we need three results which we for- mulate as Lemmas next but present their proof at the end of the section.. We

We performed several inversions with the observed geoid and topography data using the viscosity profiles shown in Figure 1.1. Most of these profiles have

For those two problems, we present algorithms that maintain a solution under edge insertions and edge deletions in time O(∆· polylog n) per update, where ∆ is the maximum vertex

In the common vole Microtus arvalis, flea infestation affects growth and body mass, de- presses host immune defences and induces anaemia (Devevey et al. 2008), which could severely

Note that Lemma 5.6 and Theorem 5.4 together imply that the problem of finding a (connected) safe set is fixed-parameter tractable when parameterized by vertex cover number..