4171 search results - page 377 / 835 » Choice numbers of graphs |
175
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
This paper addresses the following questions for a given tree T and integer d 2: (1) What is the minimum number of degree-d subtrees that partition E(T)? (2) What is the minimum n...
183
click to vote
SPAA
2004
ACM
16 years 12 days ago
2004
ACM
We present the Buffer Heap (BH), a cache-oblivious priority queue that supports Delete-Min, Delete, and Decrease-Key operations in O( 1 B log2 N B ) amortized block transfers fro...
174
click to vote
CDC
2010
IEEE
15 years 2 months ago
2010
IEEE
Existing work on programmable self assembly has focused on deterministic performance guarantees--stability of desirable states. In particular, for any acyclic target graph a binary...
188
click to vote
STOC
2007
ACM
16 years 7 months ago
2007
ACM
Given as input a directed graph on N vertices and a set of source-destination pairs, we study the problem of routing the maximum possible number of source-destination pairs on pat...
178
click to vote
IPPS
2005
IEEE
16 years 17 days ago
2005
IEEE
The problem of radio channel assignments with multiple levels of interference can be modeled using graph theory. Given a graph G, possibly infinite, and real numbers k1, k2, . . ...