| dc.creator | Dubinsky, Manuel | |
| dc.creator | Massri, Cesar Dario | |
| dc.creator | Taubin, Gabriel | |
| dc.date.accessioned | 2022-09-01T02:14:28Z | |
| dc.date.accessioned | 2022-10-14T23:04:30Z | |
| dc.date.available | 2022-09-01T02:14:28Z | |
| dc.date.available | 2022-10-14T23:04:30Z | |
| dc.date.created | 2022-09-01T02:14:28Z | |
| dc.date.issued | 2021-08 | |
| dc.identifier | Dubinsky, Manuel; Massri, Cesar Dario; Taubin, Gabriel; tinygarden - A java package for testing properties of spanning trees; Elsevier; Software Impacts; 9; 100083; 8-2021; 1-3 | |
| dc.identifier | 2665-9638 | |
| dc.identifier | http://hdl.handle.net/11336/167100 | |
| dc.identifier | CONICET Digital | |
| dc.identifier | CONICET | |
| dc.identifier.uri | https://repositorioslatinoamericanos.uchile.cl/handle/2250/4317296 | |
| dc.description.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 tinygarden, a java package for validating hypothesis, testing properties and discovering patterns from the spanning tree set of an arbitrary graph. | |
| dc.language | eng | |
| dc.publisher | Elsevier | |
| dc.relation | info:eu-repo/semantics/altIdentifier/doi/https://doi.org/10.1016/j.simpa.2021.100083 | |
| dc.relation | info:eu-repo/semantics/altIdentifier/url/https://www.sciencedirect.com/science/article/pii/S2665963821000294 | |
| dc.rights | https://creativecommons.org/licenses/by/2.5/ar/ | |
| dc.rights | info:eu-repo/semantics/openAccess | |
| dc.subject | Graphs | |
| dc.subject | Spanning trees | |
| dc.subject | Fundamental cycle bases | |
| dc.title | tinygarden - A java package for testing properties of spanning trees | |
| dc.type | info:eu-repo/semantics/article | |
| dc.type | info:ar-repo/semantics/artículo | |
| dc.type | info:eu-repo/semantics/publishedVersion | |
