The k-neighbourhood-covering problem on interval graphs

DOI10.1080/00207160802676570zbMATH Open1218.05176OpenAlexW1967303546MaRDI QIDQ5747730FDOQ5747730

Authors: Sambhu Charan Barman, Madhumangal Pal, Sukumar Mondal 

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

Recommendations

• An Optimal Algorithm to Solve 2-Neighbourhood Covering Problem on Interval Graphs
• An optimal algorithm to solve 2-neighbourhood covering problem on circular-arc graphs
• An optimal algorithm to solve 2-neighbourhood covering problem on trapezoid graphs
• The 2-neighbourhood covering problem on permutation graphs
• Generalized vertex covering in interval graphs

zbMATH Keywords

analysis of algorithmsinterval graphdesign of algorithmsinterval tree\(k\)-neighbourhood-covering

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Algorithmic Aspects of Neighborhood Numbers
• 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
• One-dimensional logic gate assignment and interval graphs
• Neighborhood perfect graphs
• k-Neighborhood-Covering and -Independence Problems for Chordal Graphs

Cited In (10)

• An optimal algorithm to solve 2-neighbourhood covering problem on trapezoid graphs
• An optimal algorithm to solve 2-neighbourhood covering problem on circular-arc graphs
• Minimum \(r\)-neighborhood covering set of permutation graphs
• An optimal algorithm to find minimum k-hop dominating set of interval graphs
• The 2-neighbourhood covering problem on permutation graphs
• \(L(2,1)\)-labeling of interval graphs
• Undecidability of Winkler's \(r\)-neighborhood problem for covering digraphs
• Title not available (Why is that?)
• An Optimal Algorithm to Solve 2-Neighbourhood Covering Problem on Interval Graphs
• The \(k\)-neighbor, \(r\)-domination problems on interval graphs

This page was built for publication: The \(k\)-neighbourhood-covering problem on interval graphs

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