منابع مشابه
Linear Arboricity and Linear k-Arboricity of Regular Graphs
We find upper bounds on the linear k-arboricity of d-regular graphs using a probabilistic argument. For small k these bounds are new. For large k they blend into the known upper bounds on the linear arboricity of regular graphs.
متن کاملwith Linear Cuts : Upper Bound
Three methods for computing the upper bound when linear cuts are performed on the uncertainty set are described. One of them is based on the computation of spherical , one involves the construction of an implicit system to implement the linear constraints, and the other reformulates the problem into a higher dimensional one such that the standard upper bound computation can be used. The quality...
متن کاملProbabilistic Upper Bound Using Linear Cuts
As a direct extension of the structured singular value framework from the worst-case to the probabilistic robustness analysis, probabilistic deenes a probability measure of performance assuming some distribution on the uncertainty. Exact computation of probabilistic is intractable. Standard branch and bound methods with axially aligned cuts had been applied to compute a hard upper bound for pro...
متن کاملA Planar Linear Arboricity Conjecture
The linear arboricity la(G) of a graph G is the minimum number of linear forests (graphs where every connected component is a path) that partition the edges of G. In 1984, Akiyama et al. [1] stated the Linear Arboricity Conjecture (LAC), that the linear arboricity of any simple graph of maximum degree ∆ is either ⌈ ∆ 2 ⌉
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematics Letters
سال: 1991
ISSN: 0893-9659
DOI: 10.1016/0893-9659(91)90054-y