• Aucun résultat trouvé

Minimize the Maximum Duty in Multi-interface Networks

N/A
N/A
Protected

Academic year: 2021

Partager "Minimize the Maximum Duty in Multi-interface Networks"

Copied!
24
0
0

Texte intégral

Loading

Figure

Fig. 1 The composed network according to available interfaces and proximities.
Fig. 2 Graph G in Theorem 1 corresponding to clauses q = (u ∨ v ∨ w), r = (v ∨ z) and s = (v ∨w ∨ z), where W (e q ) = {F u , T v , T w }, W(e r ) = {T v , F z }, and W (e s ) = {T v , F w , T z }.
Table 1 Known bounds on ownership functions for some graph classes.

Références

Documents relatifs

Atlantic Provinces Library Association Lisa Goddard.. Memorial University Libraries

In any 3-dimensional warped product space, the only possible embedded strictly convex surface with constant scalar curvature is the slice sphere provided that the embedded

First introduced by Faddeev and Kashaev [7, 9], the quantum dilogarithm G b (x) and its variants S b (x) and g b (x) play a crucial role in the study of positive representations

We construct a cohomology theory on a category of finite digraphs (directed graphs), which is based on the universal calculus on the algebra of functions on the vertices of

James presented a counterexample to show that a bounded convex set with James’ property is not necessarily weakly compact even if it is the closed unit ball of a normed space.. We

McCoy [17, Section 6] also showed that with sufficiently strong curvature ratio bounds on the initial hypersur- face, the convergence result can be established for α > 1 for a

(9) Next, we will set up an aggregation-diffusion splitting scheme with the linear transport approximation as in [6] and provide the error estimate of this method.... As a future

In this paper, we propose a nonlocal model for linear steady Stokes equation with no-slip boundary condition.. The main idea is to use volume constraint to enforce the no-slip