Listing All Maximal Cliques in Sparse Graphs in Near-optimal Time

David Eppstein, Maarten Löffler, Darren Strash

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

    Original languageEnglish
    Title of host publicationProc. 21st International Symposium on Algorithms and Computation
    Pages403-414
    Number of pages12
    DOIs
    Publication statusPublished - 2010

    Publication series

    NameLNCS 6506

    Keywords

    • GRAPH, FPT, SOCIAL

    Cite this