Sciweavers

    2 search results - page 1 / 1
    » Coarse Grained Parallel Maximum Matching In Convex Bipartite...
    Sort
    View
    IPPS
    1999
    IEEE
    134views Distributed And Parallel Com...» more  IPPS 1999»
    Coarse Grained Parallel Maximum Matching In Convex Bipartite Graphs
    13 years 11 months ago
    Coarse Grained Parallel Maximum Matching In Convex Bipartite Graphs
    Download  people.scs.carleton.ca
    We present a coarse grained parallel algorithm for computing a maximum matching in a convex bipartite graph G = A;B;E. For p processors with N=p memory per processor, N = jAj+jBj,...
    Prosenjit Bose, Albert Chan, Frank K. H. A. Dehne,...
    claim paper
    Read More »
    WG
    2000
    Springer
    105views Theoretical Computer Science» more  WG 2000»
    Coarse Grained Parallel Algorithms for Detecting Convex Bipartite Graphs
    13 years 10 months ago
    Coarse Grained Parallel Algorithms for Detecting Convex Bipartite Graphs
    Download  sbrinz.di.unipi.it
    Edson Cáceres, Albert Chan, Frank K. H. A. ...
    claim paper
    Read More »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    International On-screen Keyboard Graphical Social Symbols OCR Text Recognition CSS3 Style Generator Web Page to PDF Web Page to Image PDF Split PDF Merge Latex Equation Editor Sci2ools
    Document Tools
    PDF to Text PDF to Postscript PDF to Thumbnails Excel to PDF Word to PDF Postscript to PDF PowerPoint to PDF Latex to Word Repair Corrupted PDF
    Image Tools
    JPG to PS JPG to PDF Extract Images from PDF Image Converter
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2024, USA.