Sciweavers

4 search results - page 1 / 1
» Could any Graph be Turned into a Small-World
Sort
View
WDAG
2005
Springer
92views Algorithms» more  WDAG 2005»
14 years 8 days ago
Could any Graph be Turned into a Small-World?
Philippe Duchon, Nicolas Hanusse, Emmanuelle Lebha...
HT
2010
ACM
13 years 8 months ago
Analysis of graphs for digital preservation suitability
We investigate the use of autonomically created small-world graphs as a framework for the long term storage of digital objects on the Web in a potentially hostile environment. We ...
Charles L. Cartledge, Michael L. Nelson
SIAMDM
2010
194views more  SIAMDM 2010»
13 years 1 months ago
Combinatorics and Geometry of Finite and Infinite Squaregraphs
Abstract. Squaregraphs were originally defined as finite plane graphs in which all inner faces are quadrilaterals (i.e., 4-cycles) and all inner vertices (i.e., the vertices not in...
Hans-Jürgen Bandelt, Victor Chepoi, David Epp...
SPAA
2010
ACM
13 years 7 months ago
Scheduling to minimize power consumption using submodular functions
We develop logarithmic approximation algorithms for extremely general formulations of multiprocessor multiinterval offline task scheduling to minimize power usage. Here each proce...
Erik D. Demaine, Morteza Zadimoghaddam