44 citations · 51 across the 11 of their papers we have counts for
Showing 2020Show all
2 papers · 1 filter
math.CO2020
Intersecting longest paths in chordal graphs
Daniel J. Harvey, Michael S. Payne
We consider the size of the smallest set of vertices required to intersect every longest path in a chordal graph. Such sets are known as longest path transversals. We show that if…
cs.CG2020
Overlaid oriented Voronoi diagrams and the 1-Steiner tree problem
Michael S. Payne, Charl Ras, Marcus Volz
Overlaid oriented Voronoi diagrams (OOVDs) are known to provide useful data for the construction of optimal Euclidean -Steiner trees. The theoretical time complexity of construc…