653 search results - page 33 / 131 » The size of minimum 3-trees |
QUESTA
2008
14 years 11 months ago
2008
In this note we identify a phenomenon for processor sharing queues that is unique to ones with time-varying rates. This property was discovered while correcting a proof in Hampshi...
106
click to vote
EJC
2008
14 years 10 months ago
2008
For a graph G and a set D V (G), define Nr[x] = {xi V (G) : d(x, xi) r} (where d(x, y) is graph theoretic distance) and Dr(x) = Nr[x] D. D is known as an r-identifying code if...
104
click to vote
IAJIT
2010
14 years 10 months ago
2010
: Sorting is considered as one of the important issues of computer science. Although there is a huge number of sorting algorithms, sorting problem has attracted a great deal of res...
JDA
2010
14 years 10 months ago
2010
We introduce and analyze σ-local graphs, based on a definition of locality by Erickson [12]. We present two algorithms to construct such graphs, for any real number σ > 1 an...
118
click to vote
ORDER
2010
14 years 10 months ago
2010
Embedding a partially ordered set into a product of chains is a classical way to encode it. Such encodings have been used in various fields such as object oriented programming or ...