Results 1  10
of
342,311
A Distributed Algorithm for Finding All Best Swap Edges of a Minimum Diameter Spanning Tree
 IEEE TRANSACTIONS ON DEPENDABLE AND SECURE COMPUTING
, 2007
"... Communication in networks suffers if a link fails. When the links are edges of a tree that has been chosen from an underlying graph of all possible links, a broken link even disconnects the network. Most often, the link is restored rapidly. A good policy to deal with this sort of transient link fail ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
swapping. We propose a distributed algorithm that efficiently computes all of these swap links, and we explain how to route messages across swap edges with a compact routing scheme. Finally, we consider the computation of swap edges in an arbitrary spanning tree, where swap edges are chosen to minimize
ON FINDING MINIMUMDIAMETER CLIQUE TREES
 NORDIC JOURNAL OF COMPUTING 1(1994), 173–201.
, 1994
"... A cliquetree representation of a chordal graph often reduces the size of the data structure needed to store the graph, permitting the use of extremely efficient algorithms that take advantage of the compactness of the representation. Since some chordal graphs have many distinct cliquetree represen ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
representations, it is interesting to consider which one is most desirable under various circumstances. A clique tree of minimum diameter (or height) is sometimes a natural candidate when choosing clique trees to be processed in a parallelcomputing environment. This paper introduces a lineartime algorithm
On finding minimumdiameter clique trees
 Nordic Journal of Computing
, 1991
"... Research was supported by the Applied Mathematical Sciences Research Program of the Office of Energy Reseaxch, U.S. Department of Energy. Prepared by the ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
Research was supported by the Applied Mathematical Sciences Research Program of the Office of Energy Reseaxch, U.S. Department of Energy. Prepared by the
Approximating the Geometric MinimumDiameter Spanning Tree
 Institut für Mathematik und Informatik, Universität Greifswald
, 2002
"... Let P be a set of n points in the plane. The geometric minimumdiameter spanning tree (MDST) of P is a tree that spans P and minimizes the Euclidian length of the longest path. It is known that there is always a mono or a dipolar MDST, i.e. a MDST whose longest path consists of two or three edges, ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
Let P be a set of n points in the plane. The geometric minimumdiameter spanning tree (MDST) of P is a tree that spans P and minimizes the Euclidian length of the longest path. It is known that there is always a mono or a dipolar MDST, i.e. a MDST whose longest path consists of two or three edges
Facility Location and the Geometric MinimumDiameter Spanning Tree
, 2003
"... Let P be a set of n points in the plane. The geometric minimumdiameter spanning tree (MDST) of P is a tree that spans P and minimizes the Euclidian length of the longest path. It is known that there is always a mono or a dipolar MDST, i.e. a MDST with one or two nodes of degree greater 1, respecti ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
Let P be a set of n points in the plane. The geometric minimumdiameter spanning tree (MDST) of P is a tree that spans P and minimizes the Euclidian length of the longest path. It is known that there is always a mono or a dipolar MDST, i.e. a MDST with one or two nodes of degree greater 1
A Distributed Algorithm for All Best Swap Edges of a Minimum Diameter Spanning Tree ∗ (Regular Submission)
"... Communication in networks suffers if a link fails. When the links are edges of a tree that has been chosen from an underlying graph of all possible links, a broken link even disconnects the network. Most often, the link is restored rapidly. A good policy to deal with this sort of transient link fail ..."
Abstract
 Add to MetaCart
the same objective as the originally chosen communication subnetwork. We are interested in a minimum diameter tree in a graph with edge weights (so as to minimize the maximum travel time of messages). Hence, each swap link must minimize (among all possible swaps) the diameter of the tree that results from
Computing a (1 + ffl)Approximate Geometric MinimumDiameter Spanning Tree
, 2003
"... Abstract Given a set P of points in the plane, a geometric minimumdiameter spanning tree (GMDST)of P is a spanning tree of P such that the longest path through the tree is minimized. Forseveral years, the best upper bound on the time to compute a GMDST was cubic with respect to the number of points ..."
Abstract
 Add to MetaCart
Abstract Given a set P of points in the plane, a geometric minimumdiameter spanning tree (GMDST)of P is a spanning tree of P such that the longest path through the tree is minimized. Forseveral years, the best upper bound on the time to compute a GMDST was cubic with respect to the number
Finding community structure in networks using the eigenvectors of matrices
, 2006
"... We consider the problem of detecting communities or modules in networks, groups of vertices with a higherthanaverage density of edges connecting them. Previous work indicates that a robust approach to this problem is the maximization of the benefit function known as “modularity ” over possible div ..."
Abstract

Cited by 500 (0 self)
 Add to MetaCart
We consider the problem of detecting communities or modules in networks, groups of vertices with a higherthanaverage density of edges connecting them. Previous work indicates that a robust approach to this problem is the maximization of the benefit function known as “modularity ” over possible
The ubiquitous Btree
 ACM Computing Surveys
, 1979
"... Btrees have become, de facto, a standard for file organization. File indexes of users, dedicated database systems, and generalpurpose access methods have all been proposed and nnplemented using Btrees This paper reviews Btrees and shows why they have been so successful It discusses the major var ..."
Abstract

Cited by 653 (0 self)
 Add to MetaCart
Btrees have become, de facto, a standard for file organization. File indexes of users, dedicated database systems, and generalpurpose access methods have all been proposed and nnplemented using Btrees This paper reviews Btrees and shows why they have been so successful It discusses the major
A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks
, 1997
"... We present a new distributed routing protocol for mobile, multihop, wireless networks. The protocol is one of a family of protocols which we term "link reversal" algorithms. The protocol's reaction is structured as a temporallyordered sequence of diffusing computations; each computat ..."
Abstract

Cited by 1095 (6 self)
 Add to MetaCart
We present a new distributed routing protocol for mobile, multihop, wireless networks. The protocol is one of a family of protocols which we term "link reversal" algorithms. The protocol's reaction is structured as a temporallyordered sequence of diffusing computations; each
Results 1  10
of
342,311