Sharp Tractability Borderlines for Finding Connected Motifs in Vertex-Colored Graphs

Michael Fellows, G Fertin, D Hermelin, S Vialette

    Research output: Chapter in Book/Report/Conference proceedingConference Paper published in Proceedings

    Original languageEnglish
    Title of host publicationLecture Notes in Computer Science
    Place of PublicationBerlin, Germany
    PublisherSpringer
    Pages-
    Number of pages12
    ISBN (Print)0302-9743
    Publication statusPublished - 2007
    EventICALP 2007. International Colloquium on Automata, Languages and Programming - Wroclaw
    Duration: 9 Jul 200713 Jul 2007

    Conference

    ConferenceICALP 2007. International Colloquium on Automata, Languages and Programming
    Period9/07/0713/07/07

    Cite this

    Fellows, M., Fertin, G., Hermelin, D., & Vialette, S. (2007). Sharp Tractability Borderlines for Finding Connected Motifs in Vertex-Colored Graphs. In Lecture Notes in Computer Science (pp. -). Berlin, Germany: Springer.