We gratefully acknowledge support from
the Simons Foundation and member institutions.
Full-text links:

Download:

Current browse context:

cs.DM

Change to browse by:

References & Citations

DBLP - CS Bibliography

Bookmark

(what is this?)
CiteULike logo BibSonomy logo Mendeley logo del.icio.us logo Digg logo Reddit logo

Computer Science > Discrete Mathematics

Title: tinygarden -- A java package for testing properties of spanning trees

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.
Subjects: Discrete Mathematics (cs.DM); Combinatorics (math.CO)
DOI: 10.1016/j.simpa.2021.100083
Cite as: arXiv:2404.16878 [cs.DM]
  (or arXiv:2404.16878v1 [cs.DM] for this version)

Submission history

From: Manuel Dubinsky [view email]
[v1] Mon, 22 Apr 2024 13:43:01 GMT (42kb,D)

Link back to: arXiv, form interface, contact.