Spanning Tree
353 Followers
Recent papers in Spanning Tree
We study approximation hardness of the Minimum Dominating Set problem and its variants in undirected and directed graphs. Using a similar result obtained by Trevisan for Minimum Set Cover we prove the first explicit approximation lower... more
The concept of connectivity plays an important role in both theory and applications of fuzzy graphs. Depending on the strength of an arc, this paper classifies arcs of a fuzzy graph into three types namely αα-strong, ββ-strong and... more
A spanning tree of a connected graph is a sub graph that is a tree and connects all the vertices together. A single graph can have many different spanning trees. We can also assign a weight to each edge, which is a number representing how... more
During this time, the method of solving transportation problem was conducted by Northwest-Corner (NWC), Least-Cost (LC), and Vogel’ Approximation (VAM). To achive optimum value, there are several methods, the stepping-stone method,... more
We study minimum cost spanning tree problems and define a cost sharing rule that satisfies many more properties than other rules in the literature. Furthermore, we provide an axiomatic characterization based on monotonicity properties.
The Spanning Tree Protocol (STP) is a network protocol that builds a loop-free logical topology for Ethernet networks. The basic function of STP is to prevent bridge loops and the broadcast radiation that results from them.
The internet of things(IoT) has rapid de-velopment in recent years, so that it is becoming more and more important in our lives. There will be more than billions devices connected to the internet in the near future. How to find the... more
Neste artigo é apresentada uma abordagem de cunho técnico e prático para a identificação da funcionalidade e aplicabilidade dos equipamentos de interconexão de redes mais relevantes no status atual da tecnologia (pontes, roteadores e... more
Requirements prioritization is an important activity during requirements collection and management phase of software engineering. Prioritization of small size requirements is not an issue but its importance increases when requirements are... more
This paper examines the optimization of the 64-bit spanning tree carry lookahead adder by sizing the transistors in the different Manchester carry chain blocks and by adjusting the block widths within the carry tree to reduce the critical... more
Mobile Ad-hoc Networks (MANETs) are highly decentralized, independent and self-organizing networks. It is significant to study the cost of the network, to optimize the routing method by means of cross layer interaction across the layers... more
The algorithm relies on a parallel algorithm for generating low-stretch spanning trees or spanning subgraphs. To this end, we first develop a parallel decomposition algorithm that in polylogarithmic depth and $\otilde(|E|)$ work,... more