2432 search results - page 36 / 487 » Degrees and choice numbers |
100
click to vote
DM
2010
15 years 2 months ago
2010
For graphs of bounded maximum degree, we consider acyclic t-improper colourings, that is, colourings in which each bipartite subgraph consisting of the edges between two colour cl...
123
click to vote
CORR
2006
Springer
15 years 1 months ago
2006
Springer
Fischer proposes in [4] a sequential algorithm to compute a minimum weight spanning tree of maximum degree at most b + logb n in time O n4+1/ln b for any constant b > 1, where ...
111
click to vote
GLOBECOM
2008
IEEE
15 years 8 months ago
2008
IEEE
— The 4 user single input multiple output (SIMO) Gaussian interference channel where each transmitter has a single antenna and each receiver has two antennas is studied. We show ...
SEMCO
2008
IEEE
15 years 8 months ago
2008
IEEE
Mediation and integration of data are significant challenges because the number of services on the Web, and heterogeneities in their data representation, continue to increase rap...
COCOON
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. An undirected graph G = (V, E) is the k-power of an undirected tree T = (V, E ) if (u, v) ∈ E iff u and v are connected by a path of length at most k in T. The tree T ...