An Optimal Algorithm to Solve 2-Neighbourhood Covering Problem on Interval Graphs

DOI10.1080/00207160211921zbMath1064.68072OpenAlexW2103532004MaRDI QIDQ4780532

Madhumangal Pal, Sukumar Mondal, Tapan Kumar Pal

Publication date: 2002

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160211921

zbMATH Keywords

interval tree

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (6)

The interval-merging problem ⋮ An optimal algorithm to find minimum k-hop dominating set of interval graphs ⋮ Minimum 2-tuple dominating set of an interval graph ⋮ \(L(2,1)\)-labeling of interval graphs ⋮ Thek-neighbourhood-covering problem on interval graphs ⋮ Minimum r-neighborhood covering set of permutation graphs

Cites Work

• Unnamed Item
• Neighborhood perfect graphs
• One-dimensional logic gate assignment and interval graphs
• k-Neighborhood-Covering and -Independence Problems for Chordal Graphs
• THE PARALLEL ALGORITHMS FOR DETERMINING EDGE-PACKING AND EFFICIENT EDGE DOMINATING SETS IN INTERVAL GRAPHS
• Optimal sequential and parallel algorithms for computing the diameter and the center of an interval graph
• Algorithmic Aspects of Neighborhood Numbers

This page was built for publication: An Optimal Algorithm to Solve 2-Neighbourhood Covering Problem on Interval Graphs