Publications
Search

Publications :: Search

The parameterised complexity of counting connected subgraphs and graph motifs.

Show publication

On this page you see the details of the selected publication.

    Publication properties
    Title: The parameterised complexity of counting connected subgraphs and graph motifs.
    Rating: (not rated yet)
    Discussion: 0 comments
    Date: 2015
    Publication type: Conference paper
    Authors:
    No. First name Last name Show
    1. Mark Jerrum
    2. Kitty Meeks
    Download (by DOI): 10.1016/j.jcss.2014.11.015
    BibTeX: journals/jcss/JerrumM15
    DBLP: db/journals/jcss/jcss81.html#JerrumM15
    Bookmark:

    The following keywords have been assigned to this publication so far. If you have logged in, you can tag this publication with additional keywords.

    Keywords
    No keywords have been assigned to this publication yet.

    If you log in you can tag this publication with additional keywords

    A publication can refer to another publication (outgoing references) or it can be referred to by other publications (incoming references).

    Incoming References
    No incoming references have been assigned to this publication yet.
    Outgoing References
    No outgoing references have been assigned to this publication yet.

    If you log in you can add references to other publications

    A publication can be assigned to a conference, a journal or a school.

    Journal
    Name: J. Comput. Syst. Sci.
    Year: 2015
    Volume: 81
    Number: 1
    DBLP: db/journals/jcss/jcss81.html