Printer Friendly

Articles from Discrete Mathematics and Theoretical Computer Science (November 1, 2011)

1-7 out of 7 article(s)
Title Author Type Words
Digital search trees with m trees: level polynomials and insertion costs. Prodinger, Helmut Report 1824
New upper bounds for the heights of some light subgraphs in 1-planar graphs with high minimum degree. Xin, Zhang; Wu, Jian-Liang; Liu, Guizhen Report 5976
On the book thickness of k-trees. Dujmovic, Vida; Wood, David R. Report 2959
On the complexity of vertex-coloring edge-weightings. Dudek, Andrzej; Wajc, David Report 2710
On the number of factors in codings of three interval exchange. Ambroz, Petr; Frid, Anna; Masakova, Zuzana; Pelantova, Edita Report 6388
On the number of maximal independent sets in a graph. Wood, David R. Report 1143
The variance of the profile in digital search trees. Kazemi, Ramin; Vahidi-Asl, Mohammad Q. Report 7114

Terms of use | Privacy policy | Copyright © 2021 Farlex, Inc. | Feedback | For webmasters |