Pattern Avoidance in Task-Precedence Posets
We have extended classical pattern avoidance to a new structure: multiple task-precedence posets whose Hasse diagrams have three levels, which we will call diamonds. The vertices of each diamond are assigned labels which are compatible with the poset. A corresponding permutation is formed by reading...
保存先:
| 主要な著者: | , , , |
|---|---|
| フォーマット: | Artigo |
| 言語: | Inglês |
| 出版事項: |
Discrete Mathematics & Theoretical Computer Science
2016-06-01
|
| シリーズ: | Discrete Mathematics & Theoretical Computer Science |
| 主題: | |
| オンライン･アクセス: | https://dmtcs.episciences.org/1324/pdf |
| タグ: |
タグなし, このレコードへの初めてのタグを付けませんか!
|