VSE knjižnice (vzajemna bibliografsko-kataložna baza podatkov COBIB.SI)
  • Embeddings of graphs of fixed treewidth and bounded degree
    Gross, Jonathan L.
    Let ▫$\mathcal{F}$▫ be any family of graphs of fixed treewidth and bounded degree. We construct a quadratic-time algorithm for calculating the genus distribution of the graphs in ▫$\mathcal{F}$▫. ... Within a post-order traversal of the decomposition tree, the algorithm involves a full-powered upgrading of production rules and root-popping. This algorithm for calculating genus distributions in quadratic time complements an algorithm of Kawarabayashi, Mohar, and Reed for calculating the minimum genus of a graph of bounded treewidth in linear time.
    Vir: Ars mathematica contemporanea. - ISSN 1855-3966 (Vol. 7, no. 2, 2014, str. 379-403)
    Vrsta gradiva - članek, sestavni del ; neleposlovje za odrasle
    Leto - 2014
    Jezik - angleški
    COBISS.SI-ID - 17064281