Sciweavers

3396 search results - page 355 / 680
» Tree representations of graphs
Sort
View
IPPS
2007
IEEE
16 years 1 months ago
Average Execution Time Analysis of a Self-stabilizing Leader Election Algorithm
This paper deals with the self-stabilizing leader election algorithm of Xu and Srimani [10] that finds a leader in a tree graph. The worst case execution time for this algorithm ...
Juan Paulo Alvarado-Magaña, José Alb...
IPPS
2003
IEEE
16 years 2 hour ago
An Extended Link Reversal Protocol in Dynamic Networks
— We consider the problem of maintaining routing paths between nodes in a dynamic network. Gafni and Bertsekas proposed a link reversal approach called the BG method that maintai...
Jie Wu, Fei Dai
BIBM
2008
IEEE
106views Bioinformatics» more  BIBM 2008»
15 years 8 months ago
Uncovering Genomic Reassortments among Influenza Strains by Enumerating Maximal Bicliques
The evolutionary histories of viral genomes have received significant recent attention due to their importance in understanding virulence and the corresponding ramifications to pu...
Niranjan Nagarajan, Carl Kingsford
160
Voted
CORR
2010
Springer
134views Education» more  CORR 2010»
15 years 6 months ago
Incremental Sampling-based Algorithms for Optimal Motion Planning
During the last decade, incremental sampling-based motion planning algorithms, such as the Rapidly-exploring Random Trees (RRTs), have been shown to work well in practice and to po...
Sertac Karaman, Emilio Frazzoli
COCOA
2009
Springer
15 years 11 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