2 papers
cs.DS2026
Thin Trees for Near Minimum Cuts
Nathan Klein, Neil Olver, Zi Song Yeoh
The strong thin tree conjecture states that every -edge-connected graph contains an -thin spanning tree, meaning a spanning tree which contains at most an f…
cs.DS2023
Computing Truncated Metric Dimension of Trees
Paul Gutkovich, Zi Song Yeoh
Let be a simple, unweighted, connected graph. Let denote the distance between vertices . A resolving set of is a subset of such that knowing the…