On the complexity of crossings in permutations.
https://doi.org/10.1016/j.disc.2007.12.088
@article{DBLP:journals/dm/BiedlBD09,
author = {Therese C. Biedl and
Franz{-}Josef Brandenburg and
Xiaotie Deng},
title = {On the complexity of crossings in permutations},
journal = {Discret. Math.},
volume = {309},
number = {7},
pages = {1813--1823},
year = {2009},
url = {https://doi.org/10.1016/j.disc.2007.12.088},
doi = {10.1016/j.disc.2007.12.088},
timestamp = {Fri, 27 Mar 2020 08:45:42 +0100},
biburl = {https://dblp.org/rec/journals/dm/BiedlBD09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
本页面没有标签