Sciweavers

3008 search results - page 132 / 602
» Independence in connected graphs
Sort
View
JPDC
2007
191views more  JPDC 2007»
15 years 6 months ago
Clustering wireless ad hoc networks with weakly connected dominating set
The increasing popular personal communications and mobile computing require a wireless network infrastructure that supports selfconfiguration and self-management. Efficient clus...
Bo Han, Weijia Jia
TCBB
2011
15 years 1 months ago
Learning Genetic Regulatory Network Connectivity from Time Series Data
Recent experimental advances facilitate the collection of time series data that indicate which genes in a cell are expressed. This paper proposes an efficient method to generate th...
Nathan A. Barker, Chris J. Myers, Hiroyuki Kuwahar...
STACS
2007
Springer
16 years 16 days ago
Broadcasting vs. Mixing and Information Dissemination on Cayley Graphs
One frequently studied problem in the context of information dissemination in communication networks is the broadcasting problem. In this paper, we study the following randomized b...
Robert Elsässer, Thomas Sauerwald
CPC
2000
57views more  CPC 2000»
15 years 6 months ago
Zeros Of Reliability Polynomials And F-Vectors Of Matroids
Abstract. For a nite multigraphG, the reliability function of G is the probability RG(q) that if each edge of G is deleted independently with probability q then the remaining edges...
David G. Wagner
AAECC
2011
Springer
380views Algorithms» more  AAECC 2011»
15 years 1 months ago
The generalized road coloring problem and periodic digraphs
A proof of the Generalized Road Coloring Problem, independent of the recent work by Beal and Perrin, is presented, using both semigroup methods and Trakhtman’s algorithm. Algebra...
G. Budzban, Ph. Feinsilver