A combinatorial ranking problem

descriptionPublicationkeyboard_double_arrow_right Article 01 Feb 1976 English Publisher:Springer Science and Business Media LLCJournal:Aequationes Mathematicae, volume 14, pages 351-355 (issn: 0001-9054, eissn: 1420-8903,

Copyright policy )

Authors: Burns, R. N.; Haff, C. E.;

doi: 10.1007/bf01835983 , 10.1007/bf01836228

A combinatorial ranking problem

- Summary
- Subjects
- Metrics

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.

Related Organizations

University of Waterloo
Canada

Keywords

Extremal problems in graph theory, Algorithms in computer science, Trees

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	3
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 10%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average