The \(k\)-neighbor, \(r\)-domination problems on interval graphs

DOI10.1016/0377-2217(94)90364-6zbMath0812.90094OpenAlexW2088689837MaRDI QIDQ1342074

N. Chandrasekharan, Dipti S. Joshi, Sridhar Radhakrishnan

Publication date: 15 May 1995

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(94)90364-6

zbMATH Keywords

facility locationinterval graphs

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60) Discrete location and assignment (90B80)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Introduction to ``Topics on Domination
• The k-neighbor domination problem
• Some parallel algorithms on interval graphs
• Labeling algorithms for domination problems in sun-free chordal graphs
• State of the Art—Location on Networks: A Survey. Part II: Exploiting Tree Network Structure
• Dominating Sets in Chordal Graphs

This page was built for publication: The \(k\)-neighbor, \(r\)-domination problems on interval graphs