The following pages link to Harold N. Gabow (Q226801):
Displayed 50 items.
- Path-based depth-first search for strong and biconnected components (Q294748) (← links)
- A model for minimizing active processor time (Q487001) (← links)
- A combinatoric interpretation of dual variables for weighted matching and \(f\)-factors (Q714819) (← links)
- On the \(L_{\infty}\)-norm of extreme points for crossing supermodular directed network LPs (Q877196) (← links)
- A linear-time algorithm for a special case of disjoint set union (Q1062461) (← links)
- Scaling algorithms for network problems (Q1079135) (← links)
- Efficient algorithms for finding minimum spanning trees in undirected and directed graphs (Q1086246) (← links)
- An augmenting path algorithm for linear matroid parity (Q1087880) (← links)
- A linear-time algorithm for finding a minimum spanning pseudoforest (Q1098629) (← links)
- A linear-time recognition algorithm for interval dags (Q1149762) (← links)
- Algorithmic proofs of two relations between connectivity and the 1- factors of a graph (Q1153100) (← links)
- Forests, frames, and games: Algorithms for matroid sums and applications (Q1186784) (← links)
- A note on degree-constrained star subgraphs of bipartite graphs (Q1233725) (← links)
- Some improved bounds on the number of 1-factors of n-connected graphs (Q1237991) (← links)
- An efficient approximation algorithm for the survivable network design problem (Q1290632) (← links)
- Packing algorithms for arborescences (and spanning trees) in capacitated graphs (Q1290635) (← links)
- The limits of input-queued switch performance with future packet arrival information. (Q1398876) (← links)
- (Q1583341) (redirect page) (← links)
- Parallel tetrahedral mesh adaptation with dynamic load balancing (Q1583342) (← links)
- Incrementing bipartite digraph edge-connectivity (Q1592842) (← links)
- Efficient theoretic and practical algorithms for linear matroid intersection problems (Q1816747) (← links)
- A matroid approach to finding edge connectivity and packing arborescences (Q1892220) (← links)
- An algorithm for strongly connected component analysis in \(n \log n\) symbolic steps (Q2505621) (← links)
- Unique Maximum Matching Algorithms (Q2746432) (← links)
- Efficient splitting off algorithms for graphs (Q2817664) (← links)
- Unique maximum matching algorithms (Q2819535) (← links)
- Iterated Rounding Algorithms for the Smallest <i>k</i>-Edge Connected Spanning Subgraph (Q2884575) (← links)
- (Q2921713) (← links)
- (Q3046491) (← links)
- Approximating the smallest <i>k</i> -edge connected spanning subgraph by LP-rounding (Q3057092) (← links)
- (Q3138921) (← links)
- (Q3140422) (← links)
- Algorithmic Applications of Baur-Strassen’s Theorem (Q3177733) (← links)
- Efficient algorithms for a family of matroid intersection problems (Q3335803) (← links)
- Using expander graphs to find vertex connectivity (Q3455218) (← links)
- (Q3579373) (← links)
- Finding paths and cycles of superpolylogarithmic length (Q3581003) (← links)
- Upper degree-constrained partial orientations (Q3581581) (← links)
- On the L ∞ -Norm of Extreme Points for Crossing Supermodular Directed Network LPs (Q3596336) (← links)
- Finding Long Paths, Cycles and Circuits (Q3597877) (← links)
- (Q3682487) (← links)
- An $O(EV\log V)$ Algorithm for Finding a Maximal Weighted Matching in General Graphs (Q3718168) (← links)
- Scheduling UET Systems on Two Uniform Processors and Length Two Pipelines (Q3796734) (← links)
- Algorithms for two bottleneck optimization problems (Q3799842) (← links)
- An Almost-Linear Algorithm for Two-Processor Scheduling (Q3945581) (← links)
- Algorithms for Edge Coloring Bipartite Graphs and Multigraphs (Q3946187) (← links)
- An Efficient Implementation of Edmonds' Algorithm for Maximum Matching on Graphs (Q4091992) (← links)
- Two Algorithms for Generating Weighted Spanning Trees in Order (Q4116059) (← links)
- Decomposing symmetric exchanges in matroid bases (Q4133653) (← links)
- Finding All Spanning Trees of Directed and Undirected Graphs (Q4158476) (← links)