Sciweavers

138 search results - page 28 / 28
» An Approximation Algorithm for Weighted Weak Vertex Cover Pr...
Sort
View
BMCBI
2010
178views more  BMCBI 2010»
13 years 4 months ago
Selecting high-dimensional mixed graphical models using minimal AIC or BIC forests
Background: Chow and Liu showed that the maximum likelihood tree for multivariate discrete distributions may be found using a maximum weight spanning tree algorithm, for example K...
David Edwards, Gabriel C. G. de Abreu, Rodrigo Lab...
CIAC
2000
Springer
210views Algorithms» more  CIAC 2000»
13 years 9 months ago
Computing a Diameter-Constrained Minimum Spanning Tree in Parallel
A minimum spanning tree (MST) with a small diameter is required in numerous practical situations. It is needed, for example, in distributed mutual exclusion algorithms in order to ...
Narsingh Deo, Ayman Abdalla
COCOA
2009
Springer
13 years 9 months ago
On Open Rectangle-of-Influence Drawings of Planar Graphs
: Under water sensor network is an important research direction in computer science. There are many interesting optimization problems regarding its design, routing and applications...
Huaming Zhang, Milind Vaidya