Sciweavers

3211 search results - page 441 / 643
» On the Grundy Number of a Graph
Sort
View
IPPS
2002
IEEE
15 years 11 months ago
Reliable Communication in Faulty Star Networks
‘ We take advantage of the hierarchical structure of the star graph network to obtain an efficient method for constructing node-disjoint paths between arbitrary pairs of nodes in...
Khaled Day, Abdel Elah Al-Ayyoub
IPPS
2002
IEEE
15 years 11 months ago
A Recursion-Based Broadcast Paradigm in Wormhole Routed Mesh/Torus Networks
: A novel broadcast technique for wormhole-routed mesh and torus parallel computers based on recursion is presented in this paper. It works by partitioning the graph into several s...
Xiaotong Zhuang, Vincenzo Liberatore
P2P
2002
IEEE
178views Communications» more  P2P 2002»
15 years 11 months ago
A Scalable and Ontology-Based P2P Infrastructure for Semantic Web Services
Semantic Web Services are a promising combination of Semantic Web and Web service technology, aiming at providing means of automatically executing, discovering and composing seman...
Mario T. Schlosser, Michael Sintek, Stefan Decker,...
SPAA
2010
ACM
15 years 11 months ago
Fast distributed approximation algorithms for vertex cover and set cover in anonymous networks
We present a distributed algorithm that finds a maximal edge packing in O(∆ + log∗ W) synchronous communication rounds in a weighted graph, independent of the number of nodes...
Matti Åstrand, Jukka Suomela
CDC
2009
IEEE
115views Control Systems» more  CDC 2009»
15 years 11 months ago
Quantized consensus via adaptive stochastic gossip algorithm
Abstract— This paper is concerned with the distributed averaging problem over a given undirected graph. To enable every vertex to compute the average of the initial numbers sitti...
Javad Lavaei, Richard M. Murray