20 citations · 141 across the 41 of their papers we have counts for
Showing cs.DMShow all
3 papers · 1 filter
cs.DM2024
Lower Bounds for the Minimum Spanning Tree Cycle Intersection Problem
Manuel Dubinsky, Kun-Mao Chao, César Massri +1
Minimum spanning trees are important tools in the analysis and design of networks. Many practical applications require their computation, ranging from biology and linguistics to ec…
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 and let be a spanning tree of . Every edge induces a cycle in . The intersection of two distinct such cycles is the…