Minimum r-neighborhood covering set of permutation graphs

DOI10.1142/S1793830921500816zbMath1478.05143OpenAlexW3117683545MaRDI QIDQ5025160

Amita Samanta Adhya, Sukumar Mondal, Sambhu Charan Barman

Publication date: 1 February 2022

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s1793830921500816

zbMATH Keywords

algorithmpermutation graph\(r\)-neighborhood covering

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Enumeration in graph theory (05C30) Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bibliography on domination in graphs and some basic definitions of domination parameters
• An optimal greedy heuristic to color interval graphs
• An efficient algorithm to find next-to-shortest path on permutation graphs
• Neighborhood perfect graphs
• Incremental modular decomposition
• k-Neighborhood-Covering and -Independence Problems for Chordal Graphs
• An Optimal Algorithm to Solve 2-Neighbourhood Covering Problem on Interval Graphs
• Algorithmic Aspects of Neighborhood Numbers
• Transitive Orientation of Graphs and Identification of Permutation Graphs
• Depth-First Search and Linear Graph Algorithms
• Thek-neighbourhood-covering problem on interval graphs

This page was built for publication: Minimum r-neighborhood covering set of permutation graphs