@Article{Taylor:2008:CCT,
  author =       "Alan Taylor and Desmond J. Higham",
  title =        "{CONTEST}: A Controllable Test Matrix Toolbox for {MATLAB}",
  journal =      "{ACM} Transactions on Mathematical Software",
  volume =       "35",
  number =       "4",
  month =        feb,
  year =         2009,
  pages =        "26:1--26:17",
  URL =          "http://doi.acm.org/10.1145/1462173.1462175",
  accepted =     "8 June 2008",
  abstract =     "
		 Large, sparse networks that describe complex interactions
		 are a common feature across a number of disciplines,
		 giving rise to many challenging matrix computational
		 tasks. Several random graph models have been proposed
		 that capture key properties of real-life networks. These
		 models provide realistic, parametrized matrices for
		 testing linear system and eigenvalue solvers. CONTEST
		 (CONtrollable TEST matrices) is a random network
		 toolbox for MATLAB that implements nine models. The
		 models produce unweighted directed or undirected graphs;
		 that is, symmetric or unsymmetric matrices with elements
		 equal to zero or one. They have one or more parameters
		 that affect features such as sparsity and characteristic
		 pathlength and all can be of arbitrary dimension. Utility
		 functions are supplied for rewiring, adding extra
		 shortcuts and subsampling, in order to create further
		 classes of networks. Other utilities convert the
		 adjacency matrices into real-valued coefficient matrices
		 for naturally arising computational tasks that reduce
		 to sparse linear system and eigenvalue problems.",
}