Sciweavers

4137 search results - page 18 / 828
» On the number of matchings of a tree
Sort
View
DAM
2007
141views more  DAM 2007»
13 years 7 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
OPODIS
2008
13 years 9 months ago
Computing and Updating the Process Number in Trees
The process number is the minimum number of requests that have to be simultaneously disturbed during a routing reconfiguration phase of a connection oriented network. From a graph ...
David Coudert, Florian Huc, Dorian Mazauric
ICDE
2004
IEEE
155views Database» more  ICDE 2004»
14 years 9 months ago
A Prime Number Labeling Scheme for Dynamic Ordered XML Trees
Efficient evaluation of XML queries requires the determination of whether a relationship exists between two elements. A number of labeling schemes have been designed to label the ...
Xiaodong Wu, Mong-Li Lee, Wynne Hsu
GLOBECOM
2006
IEEE
14 years 1 months ago
On the Number of MPLS LSPs using Multicast Tree Aggregation
Joanna Moulierac, Alexandre Guitton, Miklós...