An analysis of the size of the minimum dominating sets in random recursive trees, using the Cockayne-Goodman-Hedetniemi algorithm (2009)

First Author: Cooper C

Attributed to: SCALE-FREE STRUCTURES: MODELS AND ALGORITHMS funded by EPSRC

Abstract

No abstract provided

Bibliographic Information

Digital Object Identifier: http://dx.doi.org/10.1016/j.dam.2008.06.024

Publication URI: http://dx.doi.org/10.1016/j.dam.2008.06.024

Type: Journal Article/Review

Parent Publication: Discrete Applied Mathematics

Issue: 9