1090 search results - page 59 / 218 » Priority Algorithms for Graph Optimization Problems |
KDD
2005
ACM
14 years 10 months ago
2005
ACM
Graph clustering (also called graph partitioning) -- clustering the nodes of a graph -- is an important problem in diverse data mining applications. Traditional approaches involve...
CORR
2010
Springer
13 years 10 months ago
2010
Springer
Graphs provide an efficient tool for object representation in various computer vision applications. Once graph-based representations are constructed, an important question is how ...
COMPGEOM
2006
ACM
14 years 4 months ago
2006
ACM
A triangulation of a planar point set S is a maximal plane straight-line graph with vertex set S. In the minimum weight triangulation (MWT) problem, we are looking for a triangula...
PDPTA
2007
13 years 11 months ago
2007
- The MASC (for Multiple Associative Computing) model is a SIMD model enhanced with associative properties and multiple synchronous instruction streams (IS). A number of algorithms...
STOC
2009
ACM
14 years 11 months ago
2009
ACM
We present an improved oracle for the distance sensitivity problem. The goal is to preprocess a directed graph G = (V, E) with non-negative edge weights to answer queries of the f...