Solving the Absolute 1-Center Problem in the Quickest Path Case
Sign Up to like & getrecommendations! Published in 2021 at "Bulletin of the Iranian Mathematical Society"
DOI: 10.1007/s41980-021-00536-4
Abstract: An undirected graph $$G=(V,A)$$ G = ( V , A ) by a set V of n nodes, a set A of m edges, and a set $$D\subseteq V$$ D ⊆ V consists of h… read more here.
Keywords: center problem; quickest path; absolute center; problem ... See more keywords