• search
    search
  • reviewers
    reviewers
  • feeds
    feeds
  • assignments
    assignments
  • settings
  • logout

A fully parallel block independent set algorithm for distributed sparse matrices.

Chi ShenJun Zhang
Published in: Parallel Comput. (2003)
Keyphrases
  • sparse matrices
  • computational complexity
  • k means
  • optimal solution
  • dynamic programming
  • special case
  • worst case
  • linear programming
  • np hard
  • probabilistic model
  • simulated annealing
  • convergence rate