Login / Signup

On the Sizes of Permutation Networks and Consequences for Efficient Simulation of Hypercube Algorithms on Bounded-Degree Networks.

Juraj HromkovicKrzysztof LorysPrzemyslawa KanarekRalf KlasingWalter UngerHubert Wagener
Published in: STACS (1995)
Keyphrases
  • computationally efficient
  • computationally expensive
  • network structure
  • social networks
  • computational complexity
  • computationally intensive
  • decision making
  • data structure
  • graph theory