Sciweavers

5 search results - page 1 / 1
» A note on short cycles in a hypercube
Sort
View
DM
2006
55views more  DM 2006»
13 years 4 months ago
A note on short cycles in a hypercube
Maria Axenovich, Ryan Martin
TJS
2010
89views more  TJS 2010»
13 years 3 months ago
Metacube - a versatile family of interconnection networks for extremely large-scale supercomputers
The high-performance supercomputers will consist of several millions of CPUs in the next decade. The interconnection networks in such supercomputers play an important role for achi...
Yamin Li, Shietung Peng, Wanming Chu
JGT
2008
59views more  JGT 2008»
13 years 4 months ago
Pebbling and optimal pebbling in graphs
Given a distribution of pebbles on the vertices of a graph G, a pebbling move takes two pebbles from one vertex and puts one on a neighboring vertex. The pebbling number (G) is th...
David P. Bunde, Erin W. Chambers, Daniel W. Cranst...
ESA
2005
Springer
128views Algorithms» more  ESA 2005»
13 years 10 months ago
Greedy Routing in Tree-Decomposed Graphs
Milgram’s experiment (1967) demonstrated that there are short chains of acquaintances between individuals, and that these chains can be discovered in a greedy manner. Kleinberg ...
Pierre Fraigniaud
TASE
2008
IEEE
13 years 4 months ago
An Optimization-Based Approach for Design Project Scheduling
Concurrent engineering has been widely used in managing design projects to speed up the design process by concurrently performing multiple tasks. Since the progress of a design tas...
Ming Ni, Peter B. Luh, Bryan Moser