What is he best known for?
The fields of study he is best known for:
- Algorithm
- Combinatorics
- Graph theory
His primary areas of investigation include Combinatorics, Algorithm, Discrete mathematics, Matching and Spanning tree.
His Combinatorics study frequently links to adjacent areas such as Heap.
The various areas that Harold N. Gabow examines in his Algorithm study include Disjoint sets and Suurballe's algorithm.
Many of his research projects under Matching are closely connected to Folding, Protein secondary structure, Base and Rna folding with Folding, Protein secondary structure, Base and Rna folding, tying the diverse disciplines of science together.
The study incorporates disciplines such as Computational geometry, Mathematical optimization and Minimum spanning tree in addition to Spanning tree.
His Vertex research focuses on Graph theory and how it relates to Flow network.
His most cited work include:
- A linear-time algorithm for a special case of disjoint set union (485 citations)
- Scaling and related techniques for geometry problems (472 citations)
- Efficient algorithms for finding minimum spanning trees in undirected and directed graphs (420 citations)
What are the main themes of his work throughout his whole career to date?
The scientist’s investigation covers issues in Combinatorics, Discrete mathematics, Algorithm, Bipartite graph and Matching.
Approximation algorithm, Directed graph, Graph theory, Matroid and Vertex are the primary areas of interest in his Combinatorics study.
His study in Discrete mathematics focuses on Time complexity, Spanning tree, Digraph, Matroid partitioning and Matroid intersection.
As a part of the same scientific study, he usually deals with the Algorithm, concentrating on Graph coloring and frequently concerns with Chordal graph.
His research investigates the link between Bipartite graph and topics such as Edge coloring that cross with problems in Fractional coloring.
Harold N. Gabow focuses mostly in the field of Matching, narrowing it down to topics relating to Binary logarithm and, in certain cases, Priority queue.
He most often published in these fields:
- Combinatorics (75.86%)
- Discrete mathematics (64.14%)
- Algorithm (31.03%)
What were the highlights of his more recent work (between 2010-2021)?
- Combinatorics (75.86%)
- Matching (19.31%)
- Discrete mathematics (64.14%)
In recent papers he was focusing on the following fields of study:
Harold N. Gabow mostly deals with Combinatorics, Matching, Discrete mathematics, Bipartite graph and Linear programming.
His study in the field of Multigraph, Undirected graph and Vertex is also linked to topics like Special case and Algebraic algorithms.
His biological study spans a wide range of topics, including Binary logarithm, Structure, Graph and Hopcroft–Karp algorithm.
His research on Discrete mathematics often connects related topics like Shortest Path Faster Algorithm.
His research in Bipartite graph intersects with topics in Minimum weight, Open problem and Directed graph.
His Linear programming research integrates issues from Time complexity, Feasible region and Job shop scheduling.
Between 2010 and 2021, his most popular works were:
- Parallel Tetrahedral Mesh Adaptation with Dynamic Load Balancing (40 citations)
- Algorithmic Applications of Baur-Strassen’s Theorem: Shortest Cycles, Diameter, and Matchings (30 citations)
- Data Structures for Weighted Matching and Extensions to b-matching and f-factors (13 citations)
In his most recent research, the most cited papers focused on:
- Algorithm
- Combinatorics
- Graph theory
Harold N. Gabow mainly investigates Combinatorics, Discrete mathematics, Bipartite graph, Time complexity and Matching.
The concepts of his Combinatorics study are interwoven with issues in Rounding and Order.
His Discrete mathematics research incorporates elements of Linear programming, Algorithm and Feasible region.
His work deals with themes such as Minimum weight, Simple, Open problem and Directed graph, which intersect with Bipartite graph.
His studies in Time complexity integrate themes in fields like Tree, Shortest path problem, Degree and Blossom algorithm.
Harold N. Gabow combines subjects such as Shortest Path Faster Algorithm, Indifference graph, Hopcroft–Karp algorithm, Comparability graph and Chordal graph with his study of Matching.
This overview was generated by a machine learning system which analysed the scientist’s
body of work. If you have any feedback, you can
contact us
here.
