Sciweavers

646 search results - page 63 / 130
» Generalized connected domination in graphs
Sort
View
ICDCS
2006
IEEE
14 years 2 months ago
Fault-Tolerant Clustering in Ad Hoc and Sensor Networks
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...
Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer
GLVLSI
2006
IEEE
165views VLSI» more  GLVLSI 2006»
14 years 2 months ago
Block alignment in 3D floorplan using layered TCG
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...
Jill H. Y. Law, Evangeline F. Y. Young, Royce L. S...
SIGECOM
2008
ACM
122views ECommerce» more  SIGECOM 2008»
13 years 8 months ago
On the windfall of friendship: inoculation strategies on social networks
This paper studies a virus inoculation game on social networks. A framework is presented which allows the measuring of the windfall of friendship, i.e., how much players benefit i...
Dominic Meier, Yvonne Anne Oswald, Stefan Schmid, ...
WSC
1997
13 years 10 months ago
Visualize a Port in Africa
Techniques to visualize quantitative discrete event simulation input and output data are presented. General concepts connected with graphical excellence are discussed in a simulat...
James N. Robinson
GC
2007
Springer
13 years 8 months ago
Subdivision Extendibility
Let H be a multigraph and G a graph containing a subgraph isomorphic to a subdivision of H, with S ⊂ V (G) (the ground set) the image of V (H) under the isomorphism. We consider...
Ronald J. Gould, Thor Whalen