The following pages link to Andrew V. Goldberg (Q536068):
Displaying 50 items.
- An exact combinatorial algorithm for minimum graph bisection (Q747771) (← links)
- Parallel \((\Delta +1)\)-coloring of constant-degree graphs (Q1108036) (← links)
- Use of dynamic trees in a network simplex algorithm for the maximum flow problem (Q1176566) (← links)
- Processor-efficient implementation of a maximum flow algorithm (Q1178222) (← links)
- Finding minimum-cost flows by double scaling (Q1184348) (← links)
- A natural randomization strategy for multicommodity flow and related algorithms (Q1198070) (← links)
- Approximating matchings in parallel (Q1261482) (← links)
- A parallel algorithm for finding a blocking flow in an acyclic network (Q1263969) (← links)
- Negative-cycle detection algorithms (Q1300270) (← links)
- Tight bounds on the number of minimum-mean cycle cancellations and related results (Q1317475) (← links)
- (Q1386766) (redirect page) (← links)
- On implementing the push-relabel method for the maximum flow problem (Q1386767) (← links)
- Minimum-cost flows in unit-capacity networks (Q1693987) (← links)
- Maximum skew-symmetric flows and matchings (Q1885276) (← links)
- Shortest paths algorithms: Theory and experimental evaluation (Q1919099) (← links)
- New instances for maximum weight independent set from a vehicle routing application (Q2241318) (← links)
- A heuristic improvement of the Bellman-Ford algorithm (Q2367969) (← links)
- Path problems in skew-symmetric graphs (Q2563512) (← links)
- Cut Tree Algorithms: An Experimental Study (Q2709792) (← links)
- Separating Hierarchical and General Hub Labelings (Q2849935) (← links)
- Hierarchical Hub Labelings for Shortest Paths (Q2912823) (← links)
- Robust Distance Queries on Massive Networks (Q2921417) (← links)
- (Q2921666) (← links)
- (Q2921720) (← links)
- On the Complexity of Hub Labeling (Extended Abstract) (Q2946377) (← links)
- (Q2955012) (← links)
- VC-Dimension and Shortest Path Algorithms (Q3012843) (← links)
- Maximum Flows by Incremental Breadth-First Search (Q3092252) (← links)
- (Q3128880) (← links)
- (Q3128914) (← links)
- (Q3128915) (← links)
- (Q3138945) (← links)
- (Q3140424) (← links)
- Highway Dimension and Provably Efficient Shortest Path Algorithms (Q3177817) (← links)
- Finding Minimum-Cost Circulations by Successive Approximation (Q3351112) (← links)
- (Q3352816) (← links)
- Combinatorial Algorithms for the Generalized Circulation Problem (Q3362078) (← links)
- Faster and More Dynamic Maximum Flow by Incremental Breadth-First Search (Q3452823) (← links)
- Finding minimum-cost circulations by canceling negative cycles (Q3474897) (← links)
- A Practical Shortest Path Algorithm with Linear Expected Time (Q3532580) (← links)
- The Partial Augment–Relabel Algorithm for the Maximum Flow Problem (Q3541108) (← links)
- (Q3574264) (← links)
- Competitive generalized auctions (Q3579178) (← links)
- A new approach to the maximum-flow problem (Q3812009) (← links)
- Parallel Symmetry-Breaking in Sparse Graphs (Q3824434) (← links)
- (Q3840370) (← links)
- Compression and Ranking (Q3978781) (← links)
- Using Interior-Point Methods for Fast Parallel Algorithms for Bipartite Matching and Related Problems (Q3990106) (← links)
- Sublinear-Time Parallel Algorithms for Matching and Related Problems (Q4033764) (← links)
- (Q4234147) (← links)
