National University of Avellaneda

output

20162024

most citedMinimum Spanning Tree Cycle Intersection Problem

6 citations

researchers with a paper here

Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.

C. Massri3 · h 9
Manuel Dubinsky3 · h 2
G. Taubin2 · h 42
E. Martínez1 · h 17
J. Palombarini1 · h 6
Juan Cruz Barsce1 · h 3

collaborating institutions

Brown UniversityUS2 papers
Centro Científico Tecnológico - Santa FeAR1 paper
Consejo Nacional de Investigaciones Científicas y TécnicasAR1 paper
National Technological UniversityAR1 paper
National University of Villa MaríaAR1 paper

Showing cs.DMShow all

2 papers · 1 filter

cs.DM2024

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

Manuel Dubinsky, César Massri, Gabriel Taubin

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 intere…

cs.DM2021★ 6 cited

Minimum Spanning Tree Cycle Intersection Problem

Manuel Dubinsky, César Massri, Gabriel Taubin

Consider a connected graph $G$ and let $T$ be a spanning tree of $G$ . Every edge $e \in G - T$ induces a cycle in $T \cup {e}$ . The intersection of two distinct such cycles is the…