283 search results - page 15 / 57 » Linked partitions and linked cycles |
PODC
2010
ACM
14 years 28 days ago
2010
ACM
We show how to partition data structures representable by directed acyclic graphs, i.e. rooted trees, to allow for efficient complex operations, which lie beyond inserts, deletes ...
TC
1998
13 years 8 months ago
1998
—Loop networks (or Hamiltonian circulant graphs) are a popular class of fault-tolerant network topologies which include rings and complete graphs. For this class, the fundamental...
CLUSTER
2000
IEEE
13 years 9 months ago
2000
IEEE
Ring networks are enjoying renewed interest as Storage Area Networks (SANs), i.e., networks for interconnecting storage devices (e.g., disk, disk arrays and tape drives) and stora...
Publication
Concern over climate change, traffic congestion, and the health consequences of
sedentary lifestyles has resulted in a surge of interest in cycling as an efficient form of
urban ...
ICCSA
2010
Springer
13 years 11 months ago
2010
Springer
Nowadays, spatial analysis led on complex phenomenon implies the usage of data available on heterogeneous territorial meshes, that is to say misaligned meshes. Then, combine these ...