Thek-neighbourhood-covering problem on interval graphs

DOI10.1080/00207160802676570zbMath1218.05176OpenAlexW1967303546MaRDI QIDQ5747730

Madhumangal Pal, Sukumar Mondal, Sambhu Charan Barman

Publication date: 14 September 2010

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

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

zbMATH Keywords

analysis of algorithmsdesign of algorithmsinterval graphinterval tree\(k\)-neighbourhood-covering

Mathematics Subject Classification ID

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

Related Items (3)

An optimal algorithm to find minimum k-hop dominating set of interval graphs ⋮ \(L(2,1)\)-labeling of 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
• An Optimal Algorithm to Solve 2-Neighbourhood Covering Problem on 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: Thek-neighbourhood-covering problem on interval graphs