@article{Gabow1977,
author = "Gabow, Harold N.",
doi = "10.1137/0206011",
issn = "0097-5397",
journal = "SIAM Journal on Computing",
keyword = "1,branch and bound,consider this,edge exchange,electrical wiring problem,for example,graph in order of,in many practical situations,increasing weight,introduction,little wire as,n pins must be,one wants to generate,set merging,spanning trees of a,the,weighted spanning trees,wired together with as",
link = "http://epubs.siam.org/doi/abs/10.1137/0206011",
number = "1",
pages = "139--150",
title = "Two Algorithms for Generating Weighted Spanning Trees in Order",
uri = "http://epubs.siam.org/doi/abs/10.1137/0206011",
volume = "6",
year = "1977",
}