Finding the k smallest spanning trees-Reference-Cited by-同舟云学术

Finding the k smallest spanning trees

Published:1990 Issue: Volume: Page:38-47
ISSN:0302-9743
Container-title:SWAT 90
language:
Short-container-title:

Author:

Eppstein David

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-52846-6_76.pdf

Reference18 articles.

1. A. Aggarwal, H. Imai, N. Katoh, and S. Suri, Finding k Points with Minimum Diameter and Related Problems, J. Algorithms, to appear.

2. A. Aggarwal and J. Wein, Computational Geometry, MIT LCS Research Seminar Series 3, 1988.

3. M. Blum, R.W. Floyd, V.R. Pratt, R.L. Rivest, and R.E. Tarjan, Time Bounds for Selection, J. Comput. Syst. Sci. 7, 1972, 448–461.

4. H. Booth and J. Westbrook, Linear Algorithms for Analysis of Minimum Spanning and Shortest Path Trees in Planar Graphs, Tech. Rep. TR-763, Department of Computer Science, Yale University, Feb. 1990.

5. R.N. Burns and C.E. Haff, A Ranking Problem in Graphs, 5th Southeast Conf. Combinatorics, Graph Theory and Computing 19, 1974, 461–470.

Cited by 7 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Robust Estimation of Exposure Ratios in Multi-Exposure Image Stacks;IEEE Transactions on Computational Imaging;2023

2. Constant Time Enumeration by Amortization;Lecture Notes in Computer Science;2015

3. An Efficient Algorithm for Enumerating Chordless Cycles and Chordless Paths;Discovery Science;2014

4. The “Not-Too-Heavy Spanning Tree” Constraint;Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems;2007

5. The Minimum Spanning Tree Constraint;Principles and Practice of Constraint Programming - CP 2006;2006