Abstract
Let T=(V,E) be a tree graph with non-negative costs defined on the vertices. A vertex τ is called a separating vertex for u and v if the distances of τ to u and v are not equal. A set of vertices L⊆V is a feasible solution for the non-landmarks model (NL), if for every pair of distinct vertices, u,v∈V∖L, there are at least two vertices of L separating them. Such a feasible solution is called a landmark set. We analyze the structure of landmark sets for trees and design a linear time algorithm for finding a minimum cost landmark set for a given tree graph.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
