• No results found

Applying Bounds to the Two-Connected Case

New bounds on the hyper-Zagreb index for the simple connected graphs

New bounds on the hyper-Zagreb index for the simple connected graphs

... where two vertices of L(G) are adjacent if and only if they are adjacent edges of ...a connected graph with n vertices obtained from the complete bipartite graph K 2,n−2 with two vertices of degree ...

12

Bounds for the Ratio of Two Gamma Functions

Bounds for the Ratio of Two Gamma Functions

... It is easy to show that 1 if α s 1/2 , then F x < 0 for x > 0, 2 if α s 1/2, then F x > 0 for x > 0. Consequently if α s 1/2 then F strictly decreases, and since Fx → 1 as x → ∞ it follows that Fx > 1 for x > 0. But, ...

84

Visualizing Business Ecosystems: Applying a Collaborative Modelling Process in Two Case Studies

Visualizing Business Ecosystems: Applying a Collaborative Modelling Process in Two Case Studies

... Abstract Business ecosystems are increasingly gaining relevance in research and practice. Because business ecosystems progressively change, enterprises are interested in analysing their ecosystem, to identify and address ...

12

Structure and enumeration of two-connected graphs with prescribed three-connected components

Structure and enumeration of two-connected graphs with prescribed three-connected components

... ). Applying the 3-decomposition of 2-connected graphs of Section 2 to the graph T ∪ 01, we can see that there is a unique 3-connected component in T containing the vertices 0 and 1, namely M ...

33

Approximating Connected Facility Location with Lower and Upper Bounds via LP Rounding

Approximating Connected Facility Location with Lower and Upper Bounds via LP Rounding

... Let η > 1 be a parameter we may choose, larger values result in more expensive solutions with smaller violations in the lower bound. Our algorithm for LBFL has two steps and works as follows. We first find a ...

14

A Tale of Two Metrics: Simultaneous Bounds on Competitiveness and Regret

A Tale of Two Metrics: Simultaneous Bounds on Competitiveness and Regret

... these two metrics – no algorithm (deterministic or randomized) can achieve sublinear regret and a constant competitive ratio, even in the case when the objective functions are ...special case of ...

22

Assignment 2 has two connected parts, a group work case study and an individual paper

Assignment 2 has two connected parts, a group work case study and an individual paper

... has two connected parts, a group work case study and an individual paper a) Gr Group w oup work c ork case study – Global Labour in Denmark ase study – Global Labour in ...

6

Applying psychological type theory to cathedral visitors : a case study of two cathedrals in England and Wales

Applying psychological type theory to cathedral visitors : a case study of two cathedrals in England and Wales

... They are more concerned to promote harmony, than to adhere to abstract principles. For feelers interpersonal relationships are more important than impersonal objectivity. For them the heart is more important than the ...

19

Local two-sided bounds for eigenvalues of self-adjoint operators

Local two-sided bounds for eigenvalues of self-adjoint operators

... in the past. In all the above-cited works, either a particular choice of finite element spaces, or an appropriate modification of the weak formulation of the problem, has to be performed prior to the computation of the ...

34

Tighter approximation bounds for LPT scheduling in two special cases

Tighter approximation bounds for LPT scheduling in two special cases

... worst case ratio of Lpt not only in the ‘one fast machine’ case, but also for 2-divisible ...describe two instances on 2-divisible machines for which Lpt / Opt > ( √ 3 + 1 )/ ...using two ...

14

Local two-sided bounds for eigenvalues of self-adjoint operators

Local two-sided bounds for eigenvalues of self-adjoint operators

... In this case, the method of Zimmermann and Mertins for the resonant cavity problem achieves an optimal order of convergence in the context of finite elements.. multiplicity of the eigenv[r] ...

34

Two countable, biconnected, not widely connected Hausdroff spaces

Two countable, biconnected, not widely connected Hausdroff spaces

... construct two countable spaces which are biconnected without being widely connected and without a dispersion ...the case with widely connected spaces and spaces with a dispersion point, both ...

8

Some new two sided bounds for determinants of diagonally dominant matrices

Some new two sided bounds for determinants of diagonally dominant matrices

... | a ss | − u s u k . (1 : 2) The inequalities of the determinant can be applied to estimate the spectral of a matrix and to determine the nonsingularity of a matrix, etc, which are useful in numerical analysis. Some ...

9

CiteSeerX — Two Side Bounds on the Inverses of Diagonally Dominant Tridiagonal Matrices

CiteSeerX — Two Side Bounds on the Inverses of Diagonally Dominant Tridiagonal Matrices

... the bounds  i;j and ! i;j become sharper in each ...M{matrix case the  i?1;j gives the exact ratio between u i and u i?1 for all i  j ...exact bounds for the o -diagonal ...

20

Two dimensional patterns with distinct differences; constructions, bounds, and maximal anticodes

Two dimensional patterns with distinct differences; constructions, bounds, and maximal anticodes

... upper bounds on the number of dots in a DDC when we restrict the dots to lie in some simple regions (‘shapes’) in the ...lower bounds for the number of dots in the classes of DDC defined in Section ...the ...

16

Lower and upper bounds for the two-echelon capacitated location-routing problem

Lower and upper bounds for the two-echelon capacitated location-routing problem

... which two sets of operators (destroy operators and repair operators) are ...by applying different operators to S with the goal of obtaining ...search, two search spaces are considered: 2E-CVRP ...

15

Lower and upper bounds for the two-echelon capacitated location-routing problem

Lower and upper bounds for the two-echelon capacitated location-routing problem

... The two-echelon capacitated vehicle routing problem (2E-CVRP) is also a particular case of the 2E-CLRP, where the location of a single platform is known in advance and the satellites are uncapacitated with ...

16

Applying the Rule of Reason to Two–Sided Platform Businesses

Applying the Rule of Reason to Two–Sided Platform Businesses

... 10 Two–sided platforms are a special case of multisided platforms, which can serve two or more distinct groups of ...consider two–sided platforms here to simplify the discussion but the ...

16

Applying lean principles in craft brewing to improve quality and reduce costs : two KwaZulu-Natal  case studies.

Applying lean principles in craft brewing to improve quality and reduce costs : two KwaZulu-Natal case studies.

... to the beer. When a regular boil of the wort is reached, the first hops are added as a preservative and also as a bittering agent, to balance the sweetness of the wort and are usually boiled for around sixty minutes. The ...

198

Bounds on the arboricities of connected graphs

Bounds on the arboricities of connected graphs

... Caccetta, On the vertex arboricity of graphs with prescribed size, Australas.. Nash-Williams, Decomposition of finite graphs into forests, J.[r] ...

7

Show all 10000 documents...

Related subjects