The following pages link to Jianxiu Hao (Q202777):
Displayed 33 items.
- An algorithm for reversal median problem (Q551853) (← links)
- A primal simplex algorithm that solves the maximum flow problem in at most nm pivots and \(O(n^ 2m)\) time (Q750277) (← links)
- On strongly polynomial variants of the networks simplex algorithm for the maximum flow problem (Q1180817) (← links)
- Polynomial-time primal simplex algorithms for the minimum cost network flow problem (Q1193519) (← links)
- Diagnosing infeasibilities in network flow problems (Q1290604) (← links)
- On the maximum capacity augmentation algorithm for the maximum flow problem (Q1314319) (← links)
- Maximum cutwidth problem for graphs. (Q1413710) (← links)
- The extreme set condition of a graph (Q1861250) (← links)
- Estimate the distance of genome rearrangements by reversals (Q2385374) (← links)
- The adjoints of DNA graphs (Q2485892) (← links)
- (Q2828844) (← links)
- (Q2846619) (← links)
- (Q2846669) (← links)
- (Q3011712) (← links)
- (Q3011755) (← links)
- (Q3069410) (← links)
- (Q3114980) (← links)
- (Q3118075) (← links)
- (Q3118092) (← links)
- (Q3118123) (← links)
- Anti-stalling pivot rules for the network simplex algorithm (Q3470267) (← links)
- (Q3643739) (← links)
- (Q4283456) (← links)
- A Faster Algorithm for Finding the Minimum Cut in a Directed Graph (Q4314500) (← links)
- (Q4543985) (← links)
- (Q4568207) (← links)
- (Q4763403) (← links)
- (Q4903404) (← links)
- Efficient Shortest Path Simplex Algorithms (Q5202040) (← links)
- (Q5463548) (← links)
- Shortest path algorithms using dynamic breadth‐first search (Q5749160) (← links)
- Cyclic bandwidth sum of graphs (Q5943374) (← links)
- The enumeration of near-perfect matchings of factor-critical graphs (Q5957718) (← links)