A combinatorial ranking problem |
| |
| Authors: | R. N. Burns C. E. Haff |
| |
| Affiliation: | (1) Department of Combinatorics and Optimization, University of Waterloo, Waterloo, Ontario, Canada |
| |
| Abstract: | An algorithm is presented for finding annth-best spanning tree of an edge-weighted graphG. In sharp contrast to related ranking algorithms, the number of steps is a linear function of the parametern. The results apply as well to ranking the bases of an abstract matroid. |
| |
| Keywords: | Primary O5B35 |
| 本文献已被 SpringerLink 等数据库收录！ |
|
