EL-labelings and canonical spanning trees for subword complexes

IF 0.7 4区数学

Discrete Mathematics and Theoretical Computer Science Pub Date : 2012-10-04 DOI:10.1007/978-3-319-00200-2_13

Vincent Pilaud, Christian Stump

引用次数: 16

查看原文本刊更多论文

子词复合体的el标记和规范生成树

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Discrete Mathematics and Theoretical Computer Science 数学-计算机：软件工程

自引率

14.30%

发文量

期刊介绍： DMTCS is a open access scientic journal that is online since 1998. We are member of the Free Journal Network. Sections of DMTCS Analysis of Algorithms Automata, Logic and Semantics Combinatorics Discrete Algorithms Distributed Computing and Networking Graph Theory.