Sciweavers

9 search results - page 1 / 2
» An Object-Oriented Collection of Minimum Degree Algorithms
Sort
View
ISCOPE
1998
Springer
13 years 9 months ago
An Object-Oriented Collection of Minimum Degree Algorithms
The multiple minimum degree (MMD) algorithm and its variants have enjoyed 20+ years of research and progress in generating ll-reducing orderings for sparse, symmetric positive de n...
Gary Kumfert, Alex Pothen
INFOCOM
2009
IEEE
13 years 11 months ago
Minimum Maximum Degree Publish-Subscribe Overlay Network Design
—Designing an overlay network for publish/subscribe communication in a system where nodes may subscribe to many different topics of interest is of fundamental importance. For sca...
Melih Onus, Andréa W. Richa
PATMOS
2004
Springer
13 years 10 months ago
An Efficient Low-Degree RMST Algorithm for VLSI/ULSI Physical Design
Motivated by very/ultra large scale integrated circuit (VLSI/ULSI) physical design applications, we study the construction of rectilinear minimum spanning tree (RMST) with its maxi...
Yin Wang, Xianlong Hong, Tong Jing, Yang Yang, Xia...
GLOBECOM
2009
IEEE
13 years 2 months ago
Efficient Data Collection for Wireless Networks: Delay and Energy Tradeoffs
In this paper, we study efficient data collection for wireless sensor networks. We present efficient distributed algorithms with approximately the minimum delay, or the minimum mes...
Chao Ren, XuFei Mao, Xiang-Yang Li, Ping Xu, Guoju...
DAM
2007
153views more  DAM 2007»
13 years 4 months ago
Computing the minimum number of hybridization events for a consistent evolutionary history
It is now well-documented that the structure of evolutionary relationships between a set of present-day species is not necessarily tree-like. The reason for this is that reticulat...
Magnus Bordewich, Charles Semple