1172 search results - page 128 / 235 » Path Algorithms on Regular Graphs |
101
click to vote
ICML
2007
IEEE
16 years 1 months ago
2007
IEEE
Graph clustering has become ubiquitous in the study of relational data sets. We examine two simple algorithms: a new graphical adaptation of the k-medoids algorithm and the Girvan...
96
Voted
SODA
1990
ACM
15 years 1 months ago
1990
ACM
Given an unweighted planar graph G together with nets of terminals, our problem is to find a Steiner forest, i.e., vertex-disjoint trees, each of which interconnects all the termin...
120
click to vote
ICPP
2002
IEEE
15 years 5 months ago
2002
IEEE
Power aware computing has become popular recently and many techniques have been proposed to manage the energy consumption for traditional real-time applications. We have previousl...
92
Voted
APCCAS
2006
IEEE
15 years 6 months ago
2006
IEEE
—In this paper, an area/delay efficient recoding method for parallel CORDIC (COordinate Rotation DIgital Computer) rotation algorithm is proposed. This recoding method can reduce...
140
click to vote
APPROX
2000
Springer
15 years 5 months ago
2000
Springer
Given a graph (directed or undirected) with costs on the edges, and an integer k, we consider the problem of nding a k-node connected spanning subgraph of minimum cost. For the ge...