The following pages link to Boris V. Cherkassky (Q1300269):
Displaying 24 items.
- Negative-cycle detection algorithms (Q1300270) (← links)
- (Q1386765) (redirect page) (← links)
- On implementing the push-relabel method for the maximum flow problem (Q1386767) (← links)
- Shortest paths algorithms: Theory and experimental evaluation (Q1919099) (← links)
- Georgy Maksimovich Adelson-Velsky (obituary) (Q2936525) (← links)
- New algorithm for generation of spanning trees (Q3033347) (← links)
- (Q3128914) (← links)
- (Q3328262) (← links)
- (Q3347646) (← links)
- (Q3494470) (← links)
- (Q3706856) (← links)
- An algorithm for finding shortest paths in a maze (Q3724109) (← links)
- (Q3791766) (← links)
- (Q3792479) (← links)
- (Q3809604) (← links)
- (Q4124571) (← links)
- Buckets, Heaps, Lists, and Monotone Priority Queues (Q4268713) (← links)
- (Q4305225) (← links)
- Negative-cycle detection algorithms (Q4595499) (← links)
- (Q4744033) (← links)
- On implementing push-relabel method for the maximum flow problem (Q5101413) (← links)
- Shortest Path Feasibility Algorithms: An Experimental Evaluation (Q5233514) (← links)
- Shortest-path feasibility algorithms (Q5406208) (← links)
- (Q5501784) (← links)
