1729 search results - page 246 / 346 » Bound Graph Polysemy |
167
click to vote
DAM
1999
15 years 5 months ago
1999
This paper deals with the problem of constructing Steiner trees of minimum weight with diameter bounded by d, spanning a given set of vertices in a graph. Exact solutions or logar...
102
click to vote
PPL
1998
15 years 5 months ago
1998
In this paper, we describe an ordering of the vertices of a 2-dimensional torus and study the upper bound on the orderly broadcast time. Along with messy broadcasting, orderly bro...
142
click to vote
IPL
2011
15 years 1 months ago
2011
In this paper, we study the stationary node distribution of a variation of the Random Waypoint mobility model, in which nodes move in a smooth way following one randomly chosen Ma...
162
click to vote
JGT
2010
15 years 25 days ago
2010
Thomassen [9] conjectured that for all natural numbers k > 0 and m, every graph of minimum degree k + 1 contains a cycle of length congruent to 2m modulo k. We prove that this ...
180
click to vote
WINE
2009
Springer
16 years 19 days ago
2009
Springer
We study the geometrical shape of the partitions of the input space created by the allocation rule of a truthful mechanism for multi-unit auctions with multidimensional types and ...