Browsing by Keywords "Graph partitioning by vertex separators"

Now showing items 1-2 of 2

    • An effective model to decompose linear programs for parallel solution 

      Pınar, Ali; Aykanat, Cevdet (Springer, 1996-08)
      Although inherent parallelism in the solution of block angulax Linear Programming (LP) problems has been exploited in many research works, the literature that addresses decomposing constraint matrices into block angular ...

    • Permuting sparse rectangular matrices into block-diagonal form 

      Aykanat, C.; Pınar, A.; Çatalyürek Ü. V. (SIAM, 2004)
      We investigate the problem of permuting a sparse rectangular matrix into block-diagonal form. Block-diagonal form of a matrix grants an inherent parallelism for solving the deriving problem, as recently investigated in the ...