Metric Locations in Pseudotrees: A Survey and New Results
José Cáceres, Ignacio M. Pelayo
Source abstract
This paper presents a comprehensive review of the literature on the original concept of metric location, along with its various adaptations and extensions that have been developed over time. Given that determining a minimum location set is generally NP-hard, we focus on analyzing the behavior of these sets within specific graph families, including paths, cycles, trees and unicyclic graphs. In addition to synthesizing existing knowledge, we contribute new findings and insights to the field, advancing the understanding of metric location problems in these structured graph classes.
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.