Sciweavers

2354 search results - page 7 / 471
» Radio number for trees
Sort
View
ALGORITHMICA
2006
74views more  ALGORITHMICA 2006»
14 years 9 months ago
On the Number of t-Ary Trees with a Given Path Length
We show that the number of t-ary trees with path length equal to p is t h(t-1) tp log2 p(1+o(1)) , where h(x)=-x log2 x-(1-x) log2(1-x) is the binary entropy function. Besides its...
Gadiel Seroussi
ISBRA
2010
Springer
15 years 4 months ago
Fast Computation of the Exact Hybridization Number of Two Phylogenetic Trees
Abstract. Hybridization is a reticulate evolutionary process. An established problem on hybridization is computing the minimum number of hybridization events, called the hybridizat...
Yufeng Wu, Jiayin Wang
84
Voted
DAM
2007
141views more  DAM 2007»
14 years 9 months ago
On the packing chromatic number of Cartesian products, hexagonal lattice, and trees
The packing chromatic number χρ(G) of a graph G is the smallest integer k such that the vertex set of G can be partitioned into packings with pairwise different widths. Several...
Bostjan Bresar, Sandi Klavzar, Douglas F. Rall
69
Voted
SODA
2004
ACM
115views Algorithms» more  SODA 2004»
14 years 11 months ago
Minimizing the stabbing number of matchings, trees, and triangulations
The (axis-parallel) stabbing number of a given set of line segments is the maximum number of segments that can be intersected by any one (axis-parallel) line. We investigate probl...
Sándor P. Fekete, Marco E. Lübbecke, H...
EDCC
2005
Springer
15 years 3 months ago
Formal Safety Analysis of a Radio-Based Railroad Crossing Using Deductive Cause-Consequence Analysis (DCCA)
Abstract. In this paper we present the formal safety analysis of a radiobased railroad crossing. We use deductive cause-consequence analysis (DCCA) as analysis method. DCCA is a no...
Frank Ortmeier, Wolfgang Reif, Gerhard Schellhorn