721 search results - page 46 / 145 » Almost universal graphs |
IPPS
1993
IEEE
15 years 5 months ago
1993
IEEE
We show the universality of the VEDIC network in simulating other well known interconnection networks by generating the parameters of the VEDtC network automatically. Algorithms a...
CORR
2010
Springer
15 years 28 days ago
2010
Springer
We study the properties of affine rigidity of a (hyper)graph and prove a variety of fundamental results. First, we show that affine rigidity is a generic property (i.e., only depen...
117
click to vote
APPT
2009
Springer
14 years 10 months ago
2009
Springer
Abstract. In this paper, we propose a universal network, called recursive dual-net (RDN). It can be used as a candidate of effective interconnection networks for massively parallel...
105
Voted
COCOON
2005
Springer
15 years 6 months ago
2005
Springer
We consider the problem of finding a balanced ordering of the vertices of a graph. More precisely, we want to minimise the sum, taken over all vertices v, of the difference betwe...
89
Voted
BPM
2010
Springer
15 years 1 months ago
2010
Springer
We propose a new semantics for the inclusive converging gateway (also known as Or-join). The new semantics coincides with the intuitive, widely agreed semantics for Or-joins on sou...