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...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Procedia computer science Ročník 223; s. 104 - 111
Hlavní autoři: Cicerone, Serafino, Stefano, Gabriele Di
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier B.V 2023
Témata:
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
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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. The mutual-visibility number of G is the cardinality of a largest mutual-visibility set of G. It is known that computing the mutual-visibility number of a graph is NP-complete, whereas it has been shown that there are exact formulas for special graph classes like paths, cycles, blocks, cographs, and grids. In this paper, we study the mutual-visibility in distance-hereditary graphs and show that the mutual-visibility number can be computed in linear time for this class.
ISSN:1877-0509
1877-0509
DOI:10.1016/j.procs.2023.08.219