3958 search results - page 422 / 792 » Dynamic Graph Algorithms with Applications |
172
click to vote
SYNASC
2005
IEEE
16 years 9 days ago
2005
IEEE
In this paper we apply integer programming (IP) based techniques to the problem of delay balancing in wave-pipelined circuits. The proposed approach considers delays, as well as f...
174
click to vote
ISCAS
2003
IEEE
15 years 12 months ago
2003
IEEE
The Hamiltonian Cycle (HC) problem is an important graph problem with many applications. The general backtracking algorithm normally used for random graphs often takes far too lon...
158
click to vote
COCOON
2010
Springer
15 years 11 months ago
2010
Springer
In the Imbalance Minimization problem we are given a graph G = (V, E) and an integer b and asked whether there is an ordering v1 . . . vn of V such that the sum of the imbalance of...
191
click to vote
FSTTCS
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. We propose a novel approach to clustering, based on deterministic analysis of random walks on the weighted graph associated with the clustering problem. The method is cen...
207
click to vote
SBBD
2007
15 years 8 months ago
2007
Abstract. A lot of recent applications dealing with complex data require sophisticated data structures (trees or graphs) for their specification. Recently, several techniques for ...