3757 search results - page 464 / 752 » The overlap number of a graph |
191
click to vote
WG
2007
Springer
16 years 23 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 21 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...
182
click to vote
ICDCS
2006
IEEE
16 years 21 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...
190
click to vote
ASPDAC
2006
ACM
16 years 19 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...
158
click to vote
IWCMC
2006
ACM
16 years 18 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...