5889 search results - page 972 / 1178 » Graph Layout Problems |
108
Voted
RSA
2000
15 years 2 months ago
2000
The choice number ch(G) of a graph G = (V, E) is the minimum number k such that for every assignment of a list S(v) of at least k colors to each vertex v V , there is a proper ve...
128
Voted
IJDSN
2008
15 years 2 months ago
2008
This article proposes a flexible and distributed stochastic automaton-based network partitioning algorithm that is capable of finding the optimal k-way partition with respect to a...
137
click to vote
PAMI
2007
15 years 2 months ago
2007
—We develop a new graph-theoretic approach for pairwise data clustering which is motivated by the analogies between the intuitive concept of a cluster and that of a dominant set ...
134
click to vote
PAMI
2007
15 years 2 months ago
2007
—A new parameter-free graph-morphology-based segmentation algorithm is proposed to address the problem of partitioning a 3D triangular mesh into disjoint submeshes that correspon...
85
Voted
CIKM
2010
Springer
15 years 1 months ago
2010
Springer
We study the problem of automatically identifying“hotspots” on the real-time web. Concretely, we propose to identify highly-dynamic ad-hoc collections of users – what we ref...