C-semiring Frameworks for Minimum Spanning Tree Problems. Bistarelli, S. & Santini, F. 2009.
doi  abstract   bibtex   
In this paper we define general algebraic frameworks for the Minimum Spanning Tree problem based on the structure of c-semirings. We propose general algorithms that can compute such trees by following different cost criteria, which must be all specific instantiation of c-semirings. Our algorithms are extensions of well-known procedures, as Prim or Kruskal, and show the expressivity of these algebraic structures. They can deal also with partially-ordered costs on the edges.
@conference{
	11391_143645,
	author = {Bistarelli, Stefano and Santini, Francesco},
	title = {C-semiring Frameworks for Minimum Spanning Tree Problems},
	year = {2009},
	publisher = {Springer},
	volume = {5486},
	booktitle = {Recent Trends in Algebraic Development Techniques, 19th International Workshop, WADT 2008},
	abstract = {In this paper we define general algebraic frameworks for the Minimum Spanning Tree problem based on the structure of c-semirings. We propose general algorithms that can compute such trees by following different cost criteria, which must be all specific instantiation of c-semirings. Our algorithms are extensions of well-known procedures, as Prim or Kruskal, and show the expressivity of these algebraic structures. They can deal also with partially-ordered costs on the edges.},
	doi = {10.1007/978-3-642-03429-9_5},	
	pages = {56--70}
}

Downloads: 0