4171 search results - page 473 / 835 » Choice numbers of graphs |
177
click to vote
GLVLSI
2006
IEEE
16 years 26 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...
188
click to vote
ICDCS
2006
IEEE
16 years 26 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...
195
click to vote
ASPDAC
2006
ACM
16 years 24 days ago
2006
ACM
Abstract— Routing tree construction is a fundamental problem in modern VLSI design. In this paper we propose CDCTree, an Obstacle-Avoiding Rectilinear Steiner Minimum Tree (OARSM...
164
click to vote
IWCMC
2006
ACM
16 years 23 days ago
2006
ACM
Self-Organized Networks (SONs) are a general description of autonomous networks without infrastructure, of which Ad Hoc, Sensor and Mesh networks are special cases. We had previou...
236
click to vote
BIBE
2005
IEEE
16 years 13 days ago
2005
IEEE
In this article we present novel preprocessing techniques, based on topological measures of the network, to identify clusters of proteins from Protein-protein interaction (PPI) ne...