Sciweavers

2354 search results - page 76 / 471
» Radio number for trees
Sort
View
ALGORITHMICA
2010
137views more  ALGORITHMICA 2010»
15 years 6 months ago
A Fully Dynamic Graph Algorithm for Recognizing Interval Graphs
We present the first dynamic graph algorithm for recognizing interval graphs. The algorithm runs in O(n log n) worst-case time per edge deletion or edge insertion, where n is the ...
Louis Ibarra
DM
2002
134views more  DM 2002»
15 years 6 months ago
Covering a hypergraph of subgraphs
Let G be a tree and let H be a collection of subgraphs of G, each having at most d connected components. Let (H) denote the maximum number of members of H no two of which share a ...
Noga Alon
COMBINATORICS
2006
105views more  COMBINATORICS 2006»
15 years 6 months ago
A New Table of Constant Weight Codes of Length Greater than 28
Existing tables of constant weight codes are mainly confined to codes of length n 28. This paper presents tables of codes of lengths 29 n 63. The motivation for creating these ...
Derek H. Smith, L. A. Hughes, Stephanie Perkins
IPPS
2005
IEEE
15 years 11 months ago
Tight Bounds for Wavelength Assignment on Trees of Rings
: A fundamental problem in communication networks is wavelength assignment (WA): given a set of routing paths on a network, assign a wavelength to each path such that the paths wit...
Zhengbing Bian, Qian-Ping Gu, Xiao Zhou
CORR
2004
Springer
118views Education» more  CORR 2004»
15 years 6 months ago
Understanding Search Trees via Statistical Physics
We study the random m-ary search tree model (where m stands for the number of branches of the search tree), an important problem for data storage in computer science, using a varie...
Satya N. Majumdar, David S. Dean, Paul L. Krapivsk...