Parallel algorithms for bipartite matching problems on distributed memory computers (Q712711): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(8 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: SparseMatrix / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: PSPIKE / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: BSPlib / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: MC21A / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: BSPedupack / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.parco.2011.09.004 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2089353209 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3324796 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The university of Florida sparse matrix collection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing a maximum cardinality matching in a bipartite graph in time \(O(n^{1,5}\sqrt{m/\log \,n})\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Power balance and apportionment algorithms for the United States Congress / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Two-Dimensional Data Distribution Method for Parallel Sparse Matrix-Vector Multiplication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic initialization for bipartite matching problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization. Theory and applications. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4827372 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Power balance and apportionment algorithms for the United States Congress / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique partitions, graph compression and speeding-up algorithms / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 19:26, 5 July 2024

scientific article
Language Label Description Also known as
English
Parallel algorithms for bipartite matching problems on distributed memory computers
scientific article

    Statements

    Parallel algorithms for bipartite matching problems on distributed memory computers (English)
    0 references
    0 references
    0 references
    18 October 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    bipartite graphs
    0 references
    parallel algorithms
    0 references
    matching
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references