• Login
    JavaScript is disabled for your browser. Some features of this site may not work without it.
    The parameterised complexity of counting connected subgraphs and graph motifs. 
    •   QMRO Home
    • School of Mathematical Sciences
    • Pure Mathematics
    • The parameterised complexity of counting connected subgraphs and graph motifs.
    •   QMRO Home
    • School of Mathematical Sciences
    • Pure Mathematics
    • The parameterised complexity of counting connected subgraphs and graph motifs.
    ‌
    ‌

    Browse

    All of QMROCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects
    ‌
    ‌

    Administrators only

    Login
    ‌
    ‌

    Statistics

    Most Popular ItemsStatistics by CountryMost Popular Authors

    The parameterised complexity of counting connected subgraphs and graph motifs.

    Volume
    81
    Pagination
    702 - 716
    DOI
    10.1016/j.jcss.2014.11.015
    Journal
    Journal of Computer and Systems Sciences
    ISSN
    0022-0000
    Metadata
    Show full item record
    Authors
    Jerrum, M; Meeks, K
    URI
    http://qmro.qmul.ac.uk/xmlui/handle/123456789/18887
    Collections
    • Pure Mathematics [62]
    Licence information
    http://dx.doi.org/10.1016/j.jcss.2014.11.015
    Twitter iconFollow QMUL on Twitter
    Twitter iconFollow QM Research
    Online on twitter
    Facebook iconLike us on Facebook
    • Site Map
    • Privacy and cookies
    • Disclaimer
    • Accessibility
    • Contacts
    • Intranet
    • Current students

    Modern Slavery Statement

    Queen Mary University of London
    Mile End Road
    London E1 4NS
    Tel: +44 (0)20 7882 5555

    © Queen Mary University of London.