335 search results - page 26 / 67 » High quality graph partitioning |
COCOON
2003
Springer
14 years 4 months ago
2003
Springer
In this paper, we approach the quality of a greedy algorithm for the maximum weighted clique problem from the viewpoint of matroid theory. More precisely, we consider the clique c...
AAIM
2009
Springer
14 years 5 months ago
2009
Springer
During the last years, a wide range of huge networks has been made available to researchers. The discovery of natural groups, a task called graph clustering, in such datasets is a ...
VC
2010
13 years 5 months ago
2010
High Dynamic Range (HDR) rendering has a growing success in video-games and virtual reality applications, as it improves the image quality and the player's immersion feeling....
ISSS
2000
IEEE
14 years 3 months ago
2000
IEEE
This paper addresses the problem of estimating lower bounds on the power consumption in scheduled data flow graphs with a fixed number of allocated resources prior to binding. T...
MFCS
2005
Springer
14 years 4 months ago
2005
Springer
Abstract. Feige and Kilian [5] showed that finding reasonable approximative solutions to the coloring problem on graphs is hard. This motivates the quest for algorithms that eithe...