3268 search results - page 383 / 654 » The hub number of a graph |
159
click to vote
SMC
2007
IEEE
16 years 27 days ago
2007
IEEE
— This paper presents two approaches to visually analyze the topic shift of a pool of documents over a given period of time. The first of the proposed methods is based on a mult...
184
click to vote
MICAI
2007
Springer
16 years 23 days ago
2007
Springer
Among various document clustering algorithms that have been proposed so far, the most useful are those that automatically reveal the number of clusters and assign each target docum...
189
click to vote
WG
2007
Springer
16 years 22 days ago
2007
Springer
A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An L-cycle cover is a cycle cover in which the length of every cycle is in the set ...
173
click to vote
GLVLSI
2006
IEEE
16 years 20 days ago
2006
IEEE
In modern IC design, the number of long on-chip wires has been growing rapidly because of the increasing circuit complexity. Interconnect delay has dominated over gate delay as te...
181
click to vote
ICDCS
2006
IEEE
16 years 20 days ago
2006
IEEE
In this paper, we study distributed approximation algorithms for fault-tolerant clustering in wireless ad hoc and sensor networks. A k-fold dominating set of a graph G = (V, E) is...