tinygarden -- A java package for testing properties of spanning trees
Discrete Mathematics
2024-04-29 v1 Combinatorics
Abstract
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.
Cite
@article{arxiv.2404.16878,
title = {tinygarden -- A java package for testing properties of spanning trees},
author = {Manuel Dubinsky and César Massri and Gabriel Taubin},
journal= {arXiv preprint arXiv:2404.16878},
year = {2024}
}