Algorithms for dense graphs and networks on the random access computer

1996/06/01 by Joseph Cheriyan, J. Cheriyan, Kurt Mehlhorn +1 · 3 citations
Computer Science · Mathematics · #Advanced Graph Theory Research #Algorithm #Bipartite graph #Combinatorics #Complexity and Algorithms in Graphs #Computer science #Digraph #Discrete mathematics #Graph #Integer (computer science) #Matching (statistics) #Mathematics #Optimization and Search Problems #Range (aeronautics) #Theory of computation #Transitive closure #Vertex (graph theory)

paper · doi:10.1007/bf01940880

crossref issued 1996/06/01 · crossref published 1996/06/01 · crossref published-print 1996/06/01 · openalex publication_date 1996/06/01 · crossref created 2005/07/27 · crossref deposited 2019/05/13 · crossref indexed 2025/08/28 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/23

Citations

• Depth-First Search and Linear Graph Algorithms
• An n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs
• A note on two problems in connexion with graphs

Cited by

• A simple test on 2-vertex- and 2-edge-connectivity
• 2-satisfiability [wikipedia]
• Path-based strong component algorithm [wikipedia]