@article {106,
	title = {VDM specification of an algorithm for graph decomposition},
	journal = {Journal of Digital Information Management},
	volume = {5},
	year = {2007},
	note = {Export Date: 10 July 2014},
	month = {2007},
	pages = {347 - 353},
	abstract = {Complex software systems need a precise specification of their intended behaviour. While graph theory plays an important role in several aspects of building such software systems, formal methods provide a rigorous mathematical framework within which a system can be described. In this paper, an algorithm for decomposing a graph into disjoint paths is presented. Such decompositions are useful, particularly in implementing software testing. VDM representation of the proposed algorithm facilitates automation of testing process without any ambiguity.},
	keywords = {Graphs decomposition algorithm, VDM, Vienna development method},
	url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-49149094335\&partnerID=40\&md5=1cb50e54c6cd978239ea452ebecd006a},
	author = {Huq, A. and Ramachandran, N.T.}
}
