@article{Gabow1986a, 
     author = "Gabow, Harold N. and Galil, Zvi and Spencer, Thomas and Tarjan, Robert E.", 
     doi = "10.1007/BF02579168", 
     issn = "0209-9683", 
     journal = "Combinatorica", 
     link = "http://link.springer.com/10.1007/BF02579168", 
     month = "jun", 
     number = "2", 
     pages = "109--122", 
     title = "Efficient algorithms for finding minimum spanning trees in undirected and directed graphs", 
     uri = "http://link.springer.com/10.1007/BF02579168", 
     volume = "6", 
     year = "1986", 
}

Problems: 361 362