Efficient computation of the characteristic polynomial of a threshold graph

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    1 Scopus citations

    Abstract

    An efficient algorithm is presented to compute the characteristic polynomial of a threshold graph. Threshold graphs were introduced by Chvátal and Hammer, as well as by Henderson and Zalcstein in 1977.A threshold graph is obtained from a one vertex graph by repeatedly adding either an isolated vertex or a dominating vertex, which is a vertex adjacent to all the other vertices. Threshold graphs are special kinds of cographs, which themselves are special kinds of graphs of clique-width 2. We obtain a running time of O(n log2 n) for computing the characteristic polynomial, while the previously fastest algorithm ran in quadratic time.

    Original languageEnglish (US)
    Title of host publicationFrontiers in Algorithmics - 9th International Workshop, FAW 2015, Proceedings
    EditorsChee Yap, Jianxin Wang
    PublisherSpringer Verlag
    Pages45-51
    Number of pages7
    ISBN (Print)9783319196466
    DOIs
    StatePublished - 2015
    Event9th International Workshop on Frontiers in Algorithmics, FAW 2015 - Guilin, China
    Duration: Jul 3 2015Jul 5 2015

    Publication series

    NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
    Volume9130
    ISSN (Print)0302-9743
    ISSN (Electronic)1611-3349

    Other

    Other9th International Workshop on Frontiers in Algorithmics, FAW 2015
    CountryChina
    CityGuilin
    Period7/3/157/5/15

    All Science Journal Classification (ASJC) codes

    • Theoretical Computer Science
    • Computer Science(all)

    Fingerprint Dive into the research topics of 'Efficient computation of the characteristic polynomial of a threshold graph'. Together they form a unique fingerprint.

    Cite this