3204 search results - page 427 / 641 » The b-chromatic Number of a Graph |
223
click to vote
CVPR
2012
IEEE
13 years 9 months ago
2012
IEEE
This paper addresses recognition of human activities with stochastic structure, characterized by variable spacetime arrangements of primitive actions, and conducted by a variable ...
184
click to vote
INFOCOM
2009
IEEE
16 years 1 months ago
2009
IEEE
—In this paper, we study an online bipartite matching problem, motivated by applications in wireless communication, content delivery, and job scheduling. In our problem, we have ...
186
click to vote
MST
2002
15 years 6 months ago
2002
We study the average number of delays suffered by packets routed using greedy (work conserving) scheduling policies. We obtain tight bounds on the worst-case average number of del...
185
click to vote
TCS
2010
15 years 5 months ago
2010
The Correlation Clustering problem, also known as the Cluster Editing problem, seeks to edit a given graph by adding and deleting edges to obtain a collection of disconnected cliq...
177
click to vote
COMBINATORICA
2007
15 years 6 months ago
2007
A complete partition of a graph G is a partition of its vertex set in which any two distinct classes are connected by an edge. Let cp(G) denote the maximum number of classes in a ...