A Lower Bound for Sorting Networks Based on the Shuffle Permutation.
C. Greg PlaxtonTorsten SuelPublished in: Math. Syst. Theory (1994)
Keyphrases
- lower bound
- upper bound
- branch and bound algorithm
- optimal solution
- lower and upper bounds
- social networks
- np hard
- objective function
- network structure
- network analysis
- data sets
- telecommunication networks
- complex networks
- network design
- heterogeneous networks
- power law
- polynomial approximation
- uniform distribution
- learning theory
- community structure
- branch and bound
- online learning
- search algorithm