Probably optimal graph motifs

Andreas Björklund, Petteri Kaski, \Lukasz Kowalik

    Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

    24 Citations (Scopus)
    Original languageEnglish
    Title of host publication30th International Symposium on Theoretical Aspects of Computer Science, (STACS 2013), Kiel, 27 February 2013 - 2 March 2013
    EditorsNatacha Portier, Thomas Wilke
    PublisherSchloss Dagstuhl - Leibniz Center for Informatics
    Pages20-31
    ISBN (Print)978-3-939897-50-7
    Publication statusPublished - 2013
    MoE publication typeA4 Article in a conference publication

    Cite this

    Björklund, A., Kaski, P., & Kowalik, L. (2013). Probably optimal graph motifs. In N. Portier, & T. Wilke (Eds.), 30th International Symposium on Theoretical Aspects of Computer Science, (STACS 2013), Kiel, 27 February 2013 - 2 March 2013 (pp. 20-31). Schloss Dagstuhl - Leibniz Center for Informatics.