Mutual-visibility in distance-hereditary graphs: a linear-time algorithm

The concept of mutual-visibility in graphs has been recently introduced. If X is a subset of vertices of a graph G, then vertices u and v are X-visible if there exists a shortest u, v-path P such that V(P) ∩ X⊆ {u, v}. If every two vertices from X are X-visible, then X is a mutual-visibility set. Th...

Full description

Bibliographic Details

Published in:	Procedia computer science Vol. 223; pp. 104 - 111
Main Authors:	Cicerone, Serafino, Stefano, Gabriele Di
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 2023
Subjects:	Computational complexity Graph algorithm Graph classes Graph invariant Mutual visibility Mutual visibility Graph classes Graph invariant Computational complexity Graph algorithm
ISSN:	1877-0509, 1877-0509
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!