4171 search results - page 227 / 835 » Choice numbers of graphs |
181
click to vote
FSTTCS
2009
Springer
16 years 1 months ago
2009
Springer
Partial Cover problems are optimization versions of fundamental and well studied problems like Vertex Cover and Dominating Set. Here one is interested in covering (or dominating) ...
163
click to vote
ICCAD
2005
IEEE
16 years 3 months ago
2005
IEEE
Technology mapping based on DAG-covering suffers from the problem of structural bias: the structure of the mapped netlist depends strongly on the subject graph. In this paper we ...
213
click to vote
SOSP
2009
ACM
16 years 3 months ago
2009
ACM
Data-intensive applications are increasingly designed to execute on large computing clusters. Grouped aggregation is a core primitive of many distributed programming models, and i...
202
click to vote
SOCIALCOM
2010
15 years 4 months ago
2010
Abstract--This paper is about how groups solve global coordination problems such as the distributed graph coloring problem. We focused on scenarios in which agents are not able to ...
273
click to vote
PAMI
2012
13 years 9 months ago
2012
Abstract—Given the size and confidence of pairwise local orderings, angular embedding (AE) finds a global ordering with a nearglobal optimal eigensolution. As a quadratic crite...