Sciweavers

1857 search results - page 14 / 372
» Minimum Degree Orderings
Sort
View
SODA
2004
ACM
124views Algorithms» more  SODA 2004»
13 years 11 months ago
Family trees: an ordered dictionary with optimal congestion, locality, degree, and search time
We consider the problem of storing an ordered dictionary data structure over a distributed set of nodes. In contrast to traditional sequential data structures, distributed data st...
Kevin C. Zatloukal, Nicholas J. A. Harvey
STOC
2007
ACM
71views Algorithms» more  STOC 2007»
14 years 10 months ago
Survivable network design with degree or order constraints
Lap Chi Lau, Joseph Naor, Mohammad R. Salavatipour...
RSA
2000
98views more  RSA 2000»
13 years 9 months ago
Degrees and choice numbers
The choice number ch(G) of a graph G = (V, E) is the minimum number k such that for every assignment of a list S(v) of at least k colors to each vertex v V , there is a proper ve...
Noga Alon
JCT
2008
109views more  JCT 2008»
13 years 9 months ago
Spanning 3-colourable subgraphs of small bandwidth in dense graphs
A conjecture by Bollob
Julia Böttcher, Mathias Schacht, Anusch Taraz