1220 search results - page 63 / 244 » Minimal Interval Completions |
DM
2008
13 years 9 months ago
2008
Let G be a minimally k-connected graph with n nodes and m edges. Mader proved that if n 3k - 2 then m k(n - k), and for n 3k - 1 an equality is possible if, and only if, G is t...
ICC
2007
IEEE
14 years 3 months ago
2007
IEEE
Abstract— We consider the problem of designing space-timefrequency linear dispersion (LD) codes in wideband multipleinput multiple-output (MIMO) antenna systems employing orthogo...
FSTTCS
2007
Springer
14 years 3 months ago
2007
Springer
We study several cost coloring problems, where we are given a graph and a cost function on the independent sets and are to find a coloring that minimizes the function costs of the...
INFOCOM
2006
IEEE
14 years 3 months ago
2006
IEEE
— Instantaneous Fair Sharing (IFS) is a traditional network ideal prescribing to share the network capacity among competing applications fairly during any infinitesimal time int...
INFOCOM
2000
IEEE
14 years 1 months ago
2000
IEEE
Abstract—The problem of route address lookup has received much attention recently and several algorithms and data structures for performing address lookups at high speeds have be...