Algorithms for dense graphs and networks on the random access computer

@article{Cheriyan2005AlgorithmsFD,
  title={Algorithms for dense graphs and networks on the random access computer},
  author={Joseph Cheriyan and Kurt Mehlhorn},
  journal={Algorithmica},
  year={2005},
  volume={15},
  pages={521-549}
}
We improve upon the running time of several graph and network algorithms when applied to dense graphs. In particular, we show how to compute on a machine with word size λ=Ω (logn) a maximal matching in ann-vertex bipartite graph in timeO(n2+n2.5/λ)=O(n2.5/logn), how to compute the transitive closure of a digraph withn vertices andm edges in timeO(n2+nm/λ), how to solve the uncapacitated transportation problem with integer costs in the range [O.C] and integer demands in the range [−U.U] in timeO… 
Matching Algorithms Are Fast in Sparse Random Graphs
TLDR
An improved average case analysis of the maximum cardinality matching problem shows that in a bipartite or general random graph on n vertices, with high probability every non-maximum matching has an augmenting path of length O(log n), and holds, if only the average degree is a large enough constant.
Matching Algorithms Are Fast in Sparse Random Graphs
AbstractWe present an improved average case analysis of the maximum cardinality matching problem. We show that in a bipartite or general random graph on n vertices, with high probability every
Incremental Cycle Detection, Topological Ordering, and Strong Component Maintenance
We present two online algorithms for maintaining a topological order of a directed n-vertex acyclic graph as arcs are added, and detecting a cycle when one is created. Our first algorithm handles m
Finding All Allowed Edges in a Bipartite Graph
TLDR
The algorithm, apart from being deterministic, improves upon that time complexity for bipartite graphs when $m=O(n^r)$ and $r<1.876$ and is elementary, conceptually simple, and easy to implement.
Finding all maximally-matchable edges in a bipartite graph
  • Tamir Tassa
  • Computer Science, Mathematics
    Theor. Comput. Sci.
  • 2012
TLDR
The algorithm, apart from being deterministic, improves upon that time complexity for bipartite graphs when m=O(n^r) and r<1.876, and is elementary, conceptually simple, and easy to implement.
Speeding up Graph Algorithms via Switching Classes
TLDR
It is shown that switching classes can be used to asymptotically speed up several super-linear unweighted graph algorithms and achieve better bounds for diameter, transitive closure, bipartite maximum matching, and general maximum matching.
Efficient algorithms for maximum weight matchings in general graphs with small edge weights
TLDR
This work presents a simple iterative algorithm that uses a maximum cardinality matching algorithm as a subroutine to solve the maximum weight matching problem in O(W √nm logn(n2/m) time, or in O (Wnω) time with high probability.
Efficient algorithms for path problems in weighted graphs
Problems related to computing optimal paths have been abundant in computer science since its emergence as a field. Yet for a large number of such problems we still do not know whether the
A New Combinatorial Approach for Sparse Graph Problems
TLDR
A new combinatorial data structure for representing arbitrary Boolean matrices that can perform fast vector multiplications with a given matrix, where the runtime depends on the sparsity of the input vector.
A scaling algorithm for maximum weight matching in bipartite graphs
TLDR
A new scaling algorithm is presented that runs in O(m√n log N) time, when the weights are integers within the range of [0,N], which improves the previous bounds of O(Nm √n) by Gabow and O(n√m log (nN) byGabow and Tarjan over 20 years ago.
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 26 REFERENCES
Fast Probabilistic Algorithms for Hamiltonian Circuits and Matchings
TLDR
Three simple efficient algorithms with good probabilistic behaviour are described and an algorithm with a run time of O ( n log n ) which almost certainly finds a perfect matching in a random graph of at least cn log n edges is analyzed.
An Improved Algorithm for Transitive Closure on Acyclic Digraphs
TLDR
An improvement on the algorithm for finding the transitive closure of an acyclic digraph G with worst case runtime O(n·ered) and space O( n·k, where k is the width of a chain decomposition.
Clique partitions, graph compression and speeding-up algorithms
TLDR
The notion of a compression of a graph ~ is defined and used to efficiently compute an optimal compression for graphs of a given size to improve upon the running times of the best-known algorithms for these problems.
New scaling algorithms for the assignment and minimum mean cycle problems
TLDR
The assignment algorithm is based on applying scaling to a hybrid version of the recent auction algorithm of Bertsekas and the successive shortest path algorithm and can be solved in O( $$\sqrt n $$ m lognC) time, which is the best available time bound to solve the minimum mean cycle problem.
Finding minimum-cost flows by double scaling
TLDR
This paper combines several techniques to yield an algorithm running in O(nm(log logU) log(nC) time on networks withn vertices, m edges, maximum arc capacityU, and maximum arc cost magnitudeC, and discusses a capacity-bounding approach to the minimum-cost flow problem.
Faster Scaling Algorithms for Network Problems
This paper presents algorithms for the assignment problem, the transportation problem, and the minimum-cost flow problem of operations research. The algorithms find a minimum-cost solution, yet run
Scan-First Search and Sparse Certificates: An Improved Parallel Algorithms for k-Vertex Connectivity
TLDR
This paper introduces a graph search called the scan-first search, and shows that a certificate with at most $k(n - 1)$ edges can be computed by executing scan- first search k times in sequence on subgraphs of G.
Computing a Maximum Cardinality Matching in a Bipartite Graph in Time O(^1.5 sqrt m/log n)
Abstract We show how to compute a maximum cardinality matching in a bipartite graph of n vertices in time O(n1.5 m log n ). For dense graphs this improves on the O( n m) algorithm of Hopcroft and
Can A Maximum Flow be Computed on o(nm) Time?
TLDR
It is shown that a maximum flow in a network with n vertices can be computed deterministically in O(n3/log n) time on a uniform-cost RAM, which improves the previous best bound of O( n3).
A note on two problems in connexion with graphs
  • E. Dijkstra
  • Mathematics, Computer Science
    Numerische Mathematik
  • 1959
TLDR
A tree is a graph with one and only one path between every two nodes, where at least one path exists between any two nodes and the length of each branch is given.
...
1
2
3
...