1964 search results - page 76 / 393 » Partitioning Based Algorithms for Some Colouring Problems |
DFG
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. We survey the conceptual framework and several applications of the iterative compression technique introduced in 2004 by Reed, Smith, and Vetta. This technique has proven...
SIAMSC
2010
13 years 2 months ago
2010
Abstract. We develop in this paper some efficient algorithms which are essential to implementations of spectral methods on the sparse grid by Smolyak's construction based on a...
GECCO
2003
Springer
14 years 1 months ago
2003
Springer
Abstract. In this paper, we propose a hybrid genetic algorithm for partitioning a VLSI circuit graph into two disjoint graphs of minimum cut size. The algorithm includes a local op...
PKDD
2010
Springer
13 years 6 months ago
2010
Springer
In this paper, we consider the link prediction problem, where we are given a partial snapshot of a network at some time and the goal is to predict the additional links formed at a ...
COCOON
1999
Springer
14 years 3 days ago
1999
Springer
Abstract: We propose a new approach for speeding up enumeration algorithms. The approach does not rely on data structures deeply, instead utilizes analysis of computation time. It ...