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

DOI10.1016/J.PROCS.2023.08.219MaRDI QIDQ6885247zbMATH OpenFDO

Authors Serafino Cicerone, Gabriele Di Stefano

Publication date 11 December 2025

Published in Procedia Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.PROCS.2023.08.219

zbMATH Keywords

computational complexitygraph algorithmgraph classesgraph invariantmutual visibility

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Cited in

(8)

• On the approximability of graph visibility problems
• Mobile mutual-visibility sets in graphs
• Coloring the vertices of a graph with mutual-visibility property
• Visibility polynomials, dual visibility spectrum, and characterization of total mutual-visibility sets
• Characterizing and computing in linear time mutual-visibility parameters in distance-hereditary graphs
• Mutual-visibility problems in Kneser and Johnson graphs
• Mutual and total mutual visibility in hypercube-like graphs
• On the approximability of graph visibility problems

This page was built for publication: Mutual-visibility in distance-hereditary graphs: a linear-time algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6885247)