Algorithms for dense graphs and networks on the random access computer (Q1918989): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Joseph Cheriyan / rank
Normal rank
 
Property / author
 
Property / author: Joseph Cheriyan / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: LEDA / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / 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: Finding minimum-cost flows by double scaling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Recent Advances in Network Flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast probabilistic algorithms for Hamiltonian circuits and matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new algorithm for the assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4038695 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scan-First Search and Sparse Certificates: An Improved Parallel Algorithm for <i>k</i>-Vertex Connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3619797 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on two problems in connexion with graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3962450 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique partitions, graph compression and speeding-up algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4195940 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster Scaling Algorithms for Network Problems / 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: Upper bounds for sorting integers on random access machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3219752 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New scaling algorithms for the assignment and minimum mean cycle problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A strong-connectivity algorithm and its applications in data flow analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3727385 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Depth-First Search and Linear Graph Algorithms / rank
 
Normal rank

Latest revision as of 12:34, 24 May 2024

scientific article
Language Label Description Also known as
English
Algorithms for dense graphs and networks on the random access computer
scientific article

    Statements

    Algorithms for dense graphs and networks on the random access computer (English)
    0 references
    0 references
    0 references
    0 references
    21 October 1996
    0 references
    network algorithms
    0 references
    dense graphs
    0 references
    assignment problem
    0 references

    Identifiers