Algorithms for dense graphs and networks on the random access computer
type: Item
instance of: scholarly article
title: Algorithms for dense graphs and networks on the random access computer
zbMATH Open document ID: 0848.68070
DOI: 10.1007/BF01940880
author: K. Mehlhorn
author: Joseph Cheriyan
published in: Algorithmica
publication date: 1996-10-21T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68M10
zbMATH DE Number: 908069
zbMATH Keywords: network algorithms
zbMATH Keywords: dense graphs
zbMATH Keywords: assignment problem
Wikidata QID: Q55952576
describes a project that uses: LEDA
MaRDI profile type: Publication
cites work: Computing a maximum cardinality matching in a bipartite graph in time \(O(n^{1,5}\sqrt{m/\log \,n})\)
cites work: Finding minimum-cost flows by double scaling
cites work: Some Recent Advances in Network Flows
cites work: Fast probabilistic algorithms for Hamiltonian circuits and matchings
cites work: A new algorithm for the assignment problem
cites work: Q4038695
cites work: Scan-First Search and Sparse Certificates: An Improved Parallel Algorithm for k-Vertex Connectivity
cites work: Q3619797
cites work: A note on two problems in connexion with graphs
cites work: Q3962450
cites work: Clique partitions, graph compression and speeding-up algorithms
cites work: Q4195940
cites work: Faster Scaling Algorithms for Network Problems
cites work: An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
cites work: Upper bounds for sorting integers on random access machines
cites work: Q3219752
cites work: New scaling algorithms for the assignment and minimum mean cycle problems
cites work: A strong-connectivity algorithm and its applications in data flow analysis
cites work: Q3727385
cites work: Depth-First Search and Linear Graph Algorithms
description: scientific article; zbMATH DE number 908069