524 search results - page 47 / 105 » On the Maximum Number of Cliques in a Graph |
INFOCOM
2009
IEEE
14 years 2 months ago
2009
IEEE
—A novel formulation for optimal sensor selection and in-network fusion for distributed inference known as the prizecollecting data fusion (PCDF) is proposed in terms of optimal ...
FOCS
2008
IEEE
14 years 2 months ago
2008
IEEE
We present a technique for transforming classical approximation algorithms into constant-time algorithms that approximate the size of the optimal solution. Our technique is applic...
ICGA
1993
13 years 9 months ago
1993
A genetic algorithms is applied to find a maximum flow from the source to sink in a weighted directed graph, where the weight associated with each edge represents its flow capacit...
JCT
2007
13 years 7 months ago
2007
We show that for each ε > 0 and each integer ∆ ≥ 1, there exists a number g such that for any graph G of maximum degree ∆ and girth at least g, the circular chromatic in...
INFOCOM
2007
IEEE
14 years 2 months ago
2007
IEEE
— We introduce a low-complexity distributed slotted MAC protocol that can support all feasible arrival rates in a wireless backhaul network (WBN). For arbitrary wireless networks...