z-logo
open-access-imgOpen Access
Parallel Algorithms for Relational Coarsest ; Partition Problems.
Author(s) -
Sanguthevar Rajasekaran,
Insup Lee
Publication year - 1993
Publication title -
scholarlycommons (university of pennsylvania)
Language(s) - Uncategorized
Resource type - Reports
DOI - 10.21236/ada288283
Subject(s) - partition (number theory) , computer science , algorithm , partition problem , mathematics , combinatorics

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom