Sciweavers

36 search results - page 2 / 8
» Labeling trees with a condition at distance two
Sort
View
JCO
2007
113views more  JCO 2007»
13 years 5 months ago
Recent progress in mathematics and engineering on optimal graph labellings with distance conditions
The problem of radio channel assignments with multiple levels of interference can be modelled using graph theory. The theory of integer vertex-labellings of graphs with distance c...
Jerrold R. Griggs, Xiaohua Teresa Jin
ISAAC
2005
Springer
120views Algorithms» more  ISAAC 2005»
13 years 11 months ago
Average Case Analysis for Tree Labelling Schemes
We study how to label the vertices of a tree in such a way that we can decide the distance of two vertices in the tree given only their labels. For trees, Gavoille et al. [7] prove...
Ming-Yang Kao, Xiang-Yang Li, Weizhao Wang
TIT
1998
100views more  TIT 1998»
13 years 5 months ago
Block-Coded PSK Modulation Using Two-Level Group Codes Over Dihedral Groups
—A length n group code over a group G is a subgroup of Gn under component-wise group operation. Group codes over dihedral groups DM, with 2M elements, that are two-level construc...
Jyoti Bali, B. Sundar Rajan
ESA
1998
Springer
175views Algorithms» more  ESA 1998»
13 years 9 months ago
Computing the Edit-Distance between Unrooted Ordered Trees
An ordered tree is a tree in which each node's incident edges are cyclically ordered; think of the tree as being embedded in the plane. Let A and B be two ordered trees. The e...
Philip N. Klein
MIAR
2006
IEEE
13 years 11 months ago
Cerebral Vascular Tree Matching of 3D-RA Data Based on Tree Edit Distance
Abstract. In this paper, we present a novel approach to matching cerebral vascular trees obtained from 3D-RA data-sets based on minimization of tree edit distance. Our approach is ...
Tommy W. H. Tang, Albert C. S. Chung