Harold N. Gabow
- Efficient algorithms for finding minimum spanning trees in undirected and directed graphs
1986/06/01 by Harold N. Gabow, Zvi Galil, Thomas Spencer +2 · 6 citations
Biochemistry, Genetics and Molecular Biology · Computer Science · #Algorithms and Data Compression #DNA and Biological Computing #Network Packet Processing and Optimization
- Data Structures for Weighted Matching and Extensions to b-matching and\n f-factors
2016/11/22 by Harold N. Gabow, Gabow, Harold N. · 4 citations
Computer Science · #Advanced Graph Theory Research #Algorithms and Data Compression #Complexity and Algorithms in Graphs #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Optimization and Search Problems
- Algebraic Algorithms for b-Matching, Shortest Undirected Paths, and f-Factors
2013/04/24 by Harold N. Gabow, Gabow, Harold N., Piotr Sankowski +1 · 1 citation
Computer Science · #Advanced Graph Theory Research #Complexity and Algorithms in Graphs #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Machine Learning and Algorithms #Optimization and Search Problems #cs.DS
- A linear-time algorithm for a special case of disjoint set union
1985/04/01 by Harold N. Gabow, Robert Endre Tarjan, Robert E. Tarjan · 1 citation
Computer Science · #Advanced Graph Theory Research #Complexity and Algorithms in Graphs #Interconnection Networks and Systems