A combinatorial ranking problem

DOI10.1007/BF01835983zbMath0327.05122OpenAlexW1993296944MaRDI QIDQ1226109

R. N. Burns, C. E. Haff

Publication date: 1976

Published in: Aequationes Mathematicae (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/136596

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Algorithms in computer science (68W99)

Related Items

Active orders for matroid bases, The convex weighting of a graph and an alternative definition of a matroid

Cites Work

• Unnamed Item
• On the shortest spanning subtree of a graph and the traveling salesman problem
• Solutions of the kth best route through a network. A review
• Onkth Best Policies
• On the Recognition of Primes by Automata
• On the Tree Graph of a Matroid
• Matroids and the greedy algorithm