Congestion-free embedding of 2(n−k) spanning trees in an arrangement graph
نویسندگان
چکیده
منابع مشابه
Congestion-free embedding of 2(n-k) spanning trees in an arrangement graph
The arrangement graph An;k is not only a generalization of star graph (nÿ k 1), but also more ̄exible. In this investigation, we elucidate the problem of embedding of multiple spanning trees in an arrangement graph with the objective of congestion-free. This result is to report how to exploit 2 nÿ k edge disjoint spanning trees in an arrangement graph, where each congestion-free spanning tre...
متن کاملEfficient Broadcasting in an Arrangement Graph Using Multiple Spanning Trees∗
The arrangement graph An,k is not only a generalization of star graph (n − k = 1), but also more flexible. Designing efficient broadcasting algorithm on a regular interconnection network is a fundamental issue for the parallel processing techniques. Two contributions are proposed in this paper. Initially, we elucidate a first result to construct n − k edge-disjoint spanning trees in an An,k. Se...
متن کاملFinding Minimum Congestion Spanning Trees
Given a graph G and a positive integer k, we want to nd k spanning trees on G, not necessarily disjoint, of minimum total weight, such that the weight of each edge is subject to a penalty function if it belongs to more than one tree. We present a polynomial time algorithm for this problem; the algorithm's complexity is quadratic in k. We also present two heuristics with complexity linear in k. ...
متن کاملMinimum congestion spanning trees in planar graphs
The main purpose of the paper is to develop an approach to evaluation or estimation of the spanning tree congestion of planar graphs. This approach is used to evaluate the spanning tree congestion of triangular grids.
متن کاملEmbedding Spanning Trees in Random Graphs
We prove that if T is a tree on n vertices with maximum degree ∆ and the edge probability p(n) satisfies: np ≥ C max{∆ log n, n } for some constant > 0, then with high probability the random graph G(n, p) contains a copy of T . The obtained bound on the edge probability is shown to be essentially tight for ∆ = n.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Systems Architecture
سال: 2001
ISSN: 1383-7621
DOI: 10.1016/s1383-7621(00)00041-2