Instruct: Given the title of a paper, retrieve paper titles that are cited by the given paper
Query: A minimum spanning tree algorithm with inverse-Ackermann type complexity
A randomized linear-time algorithm to find minimum spanning trees
A Note on Preconditioning by Low-Stretch Spanning Trees
A fast algorithm for Steiner trees
Dominator Tree Certification and Independent Spanning Trees
Maintenance of a minimum spanning forest in a dynamic planar graph
balancing minimum spanning trees and shortest - path trees .
A fast, parallel spanning tree algorithm for symmetric multiprocessors
A faster approximation algorithm for the Steiner tree problem in graphs
Minimum steiner tree construction
Faster algorithms for the shortest path problem
Incremental Exact Min-Cut in Polylogarithmic Amortized Update Time
A constant-factor approximation algorithm for the k MST problem (extended abstract)
Minimum Spanning Trees in Temporal Graphs
I/O-complexity of graph algorithms
Packing Steiner Trees
An Incremental Algorithm for a Generalization of the Shortest-Path Problem
approximating s - t minimum cuts in o ( n2 ) time .
A polylogarithmic approximation algorithm for the group Steiner tree problem
A Fast , Adaptive Variant of the Goemans-Williamson Scheme for the Prize-Collecting Steiner Tree Problem
Graph Minors for Preserving Terminal Distances Approximately - Lower and Upper Bounds
Temporal activity detection in untrimmed videos with recurrent neural networks
Behavioral and neural correlates of perceived and imagined musical timbre
Nano-ophthalmology: Applications and considerations
Analysis of neural network vector control for IPM machine in electric vehicles
Applications of Path Compression on Balanced Trees