3267 search results - page 30 / 654 » Generalized quasirandom graphs |
APPROX
2010
Springer
13 years 9 months ago
2010
Springer
Abstract. We provide improved approximation algorithms for the minmax generalization problems considered by Du, Eppstein, Goodrich, and Lueker [1]. In min-max generalization proble...
DAC
2009
ACM
14 years 8 months ago
2009
ACM
For a number of years, dataflow concepts have provided designers of digital signal processing systems with environments capable of expressing high-level software architectures as ...
UAI
2004
13 years 8 months ago
2004
Generalized belief propagation (GBP) has proven to be a promising technique for approximate inference tasks in AI and machine learning. However, the choice of a good set of cluste...
MOBICOM
2012
ACM
11 years 9 months ago
2012
ACM
While a natural fit for modeling and understanding mobile networks, time-varying graphs remain poorly understood. Indeed, many of the usual concepts of static graphs have no obvi...
IWOCA
2010
Springer
13 years 2 months ago
2010
Springer
The maximum independent set problem is NP-complete for graphs in general, but becomes solvable in polynomial time when restricted to graphs in many special classes. The problem is ...