@article{Katoh1981, 
     author = "Katoh, N. and Ibaraki, T. and Mine, H.", 
     doi = "10.1137/0210017", 
     issn = "0097-5397", 
     journal = "SIAM Journal on Computing", 
     keyword = "1,and e is a,associated with each edge,be an undirected connected,computational complexity,e,e e,edges,graph algorithm,graph with no parallel,introduction,is,kth minimum spanning tree,let g,problem is to find,set of m edges,set of n vertices,the,the minimum spanning tree,the weight w,v,where v is a", 
     link = "http://epubs.siam.org/doi/abs/10.1137/0210017", 
     number = "2", 
     pages = "247--255", 
     title = "Minimum Spanning Trees", 
     uri = "http://epubs.siam.org/doi/abs/10.1137/0210017", 
     volume = "10", 
     year = "1981", 
}

Problems: 55