The parameterised complexity of counting connected subgraphs and graph motifs.

dc.contributor.author	Jerrum, M	en_US
dc.contributor.author	Meeks, K	en_US
dc.date.accessioned	2017-01-20T14:20:59Z
dc.date.available	2015-01-01	en_US
dc.date.issued	2015	en_US
dc.date.submitted	2017-01-02T17:39:16.315Z
dc.identifier.issn	0022-0000	en_US
dc.identifier.other	4
dc.identifier.other	4
dc.identifier.other	4
dc.identifier.other	4	en_US
dc.identifier.uri	http://qmro.qmul.ac.uk/xmlui/handle/123456789/18887
dc.format.extent	702 - 716	en_US
dc.relation.ispartof	Journal of Computer and Systems Sciences	en_US
dc.rights	http://dx.doi.org/10.1016/j.jcss.2014.11.015
dc.title	The parameterised complexity of counting connected subgraphs and graph motifs.	en_US
dc.type	Article
dc.identifier.doi	10.1016/j.jcss.2014.11.015	en_US
pubs.notes	Not known	en_US
pubs.publication-status	Published	en_US
pubs.volume	81	en_US
dcterms.dateAccepted	2015-01-01	en_US

Files in this item

Files	Size	Format	View
There are no files associated with this item.