4009 search results - page 200 / 802 » Clustering on Complex Graphs |
159
click to vote
COCOON
2000
Springer
15 years 8 months ago
2000
Springer
We consider the parameterized complexity of the following problem under the framework introduced by Downey and Fellows[4]: Given a graph G, an integer parameter k and a non-trivial...
118
click to vote
CC
2006
Springer
15 years 4 months ago
2006
Springer
The sum of a coloring is the sum of the colors assigned to the vertices (assuming that the colors are positive integers). The sum (G) of graph G is the smallest sum that can be ach...
101
click to vote
CIKM
2010
Springer
15 years 2 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...
146
click to vote
CIKM
2009
Springer
15 years 10 months ago
2009
Springer
In recent years, the tourism assistance community is gradually shifting its emphasis to digital, interactive systems. Our project aims for digital tourism assistance by combining ...
118
click to vote
CSR
2009
Springer
15 years 10 months ago
2009
Springer
Muchnik’s theorem about simple conditional descriptions states that for all strings a and b there exists a short program p transforming a to b that has the least possible length ...