A linear-time algorithm for the center problem in weighted cycle graphs

We study the problem of computing the center of cycle graphs whose vertices are weighted. The distance from a vertex to a point of the graph is defined as the weight of the vertex times the length of the shortest path between the vertex and the point. The weighted center of the graph is a point of t...

Full description

Bibliographic Details

Published in:	Information processing letters Vol. 186; p. 106495
Main Authors:	Eom, Taekang, Ahn, Hee-Kap
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 01.08.2024
Subjects:	Algorithms Cycle graph Pruning Weighted center Pruning Algorithms Cycle graph Weighted center
ISSN:	0020-0190, 1872-6119
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!