Show simple item record

dc.contributor.authorJerrum, Men_US
dc.contributor.authorMeeks, Ken_US
dc.date.accessioned2017-01-20T14:20:59Z
dc.date.available2015-01-01en_US
dc.date.issued2015en_US
dc.date.submitted2017-01-02T17:39:16.315Z
dc.identifier.issn0022-0000en_US
dc.identifier.other4
dc.identifier.other4
dc.identifier.other4
dc.identifier.other4en_US
dc.identifier.urihttp://qmro.qmul.ac.uk/xmlui/handle/123456789/18887
dc.format.extent702 - 716en_US
dc.relation.ispartofJournal of Computer and Systems Sciencesen_US
dc.rightshttp://dx.doi.org/10.1016/j.jcss.2014.11.015
dc.titleThe parameterised complexity of counting connected subgraphs and graph motifs.en_US
dc.typeArticle
dc.identifier.doi10.1016/j.jcss.2014.11.015en_US
pubs.notesNot knownen_US
pubs.organisational-group/Queen Mary University of London
pubs.organisational-group/Queen Mary University of London/Faculty of Science & Engineering
pubs.organisational-group/Queen Mary University of London/Faculty of Science & Engineering/Mathematical Sciences - Staff and Research Students
pubs.publication-statusPublisheden_US
pubs.volume81en_US
dcterms.dateAccepted2015-01-01en_US


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record