A Note on Generic Tangle Algorithms
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2020
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866912376985485312 |
|---|---|
| author | Elbracht, Christian Kneip, Jay Lilian Teegen, Maximilian |
| author_facet | Elbracht, Christian Kneip, Jay Lilian Teegen, Maximilian |
| contents | In this note we gather the theoretical outlines of three basic algorithms for tangles in abstract separation systems: a naive tree search for finding tangles; an algorithm which outputs a certificate for the non-existence of tangles if possible, and otherwise a way to jump-start the naive tree search; and a way to obtain a tree-of-tangles. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2005_14648 |
| institution | arXiv |
| publishDate | 2020 |
| record_format | arxiv |
| spellingShingle | A Note on Generic Tangle Algorithms Elbracht, Christian Kneip, Jay Lilian Teegen, Maximilian Combinatorics Data Structures and Algorithms In this note we gather the theoretical outlines of three basic algorithms for tangles in abstract separation systems: a naive tree search for finding tangles; an algorithm which outputs a certificate for the non-existence of tangles if possible, and otherwise a way to jump-start the naive tree search; and a way to obtain a tree-of-tangles. |
| title | A Note on Generic Tangle Algorithms |
| topic | Combinatorics Data Structures and Algorithms |
| url | https://arxiv.org/abs/2005.14648 |