tinygarden -- A java package for testing properties of spanning trees
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2024
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866913330025725952 |
|---|---|
| author | Dubinsky, Manuel Massri, César Taubin, Gabriel |
| author_facet | Dubinsky, Manuel Massri, César Taubin, Gabriel |
| contents | Spanning trees are fundamental objects in graph theory. The spanning tree set size of an arbitrary graph can be very large. This limitation discourages its analysis. However interesting patterns can emerge in small cases. In this article we introduce \emph{tinygarden}, a java package for validating hypothesis, testing properties and discovering patterns from the spanning tree set of an arbitrary graph. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2404_16878 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | tinygarden -- A java package for testing properties of spanning trees Dubinsky, Manuel Massri, César Taubin, Gabriel Discrete Mathematics Combinatorics Spanning trees are fundamental objects in graph theory. The spanning tree set size of an arbitrary graph can be very large. This limitation discourages its analysis. However interesting patterns can emerge in small cases. In this article we introduce \emph{tinygarden}, a java package for validating hypothesis, testing properties and discovering patterns from the spanning tree set of an arbitrary graph. |
| title | tinygarden -- A java package for testing properties of spanning trees |
| topic | Discrete Mathematics Combinatorics |
| url | https://arxiv.org/abs/2404.16878 |