3204 search results - page 252 / 641 » The b-chromatic Number of a Graph |
TIT
2011
14 years 7 months ago
2011
—“If we know more, we can achieve more.” This adage also applies to networks, where more information about the network state translates into higher sum-rates. In this paper, ...
94
Voted
BROADNETS
2006
IEEE
15 years 6 months ago
2006
IEEE
: With the increase of the number of wavelengths per fiber waveband switching has been proposed to decrease the number of switching ports in optical nodes. Another concept that of ...
APSEC
1997
IEEE
15 years 5 months ago
1997
IEEE
A task-type in concurrent programs is a template of task-instances which are dynamically generated in execution of the programs. The number of the generated taskinstances may not ...
96
Voted
TCS
2008
15 years 19 days ago
2008
The replication number of a branching program is the minimum number R such that along every accepting computation at most R variables are tested more than once; the sets of variab...
112
Voted
MST
2010
14 years 7 months ago
2010
Cluster Editing is transforming a graph by at most k edge insertions or deletions into a disjoint union of cliques. This problem is fixed-parameter tractable (FPT). Here we comput...