Minimum line-neighbourhood set of an interval graph -- a linear time algorithm

MaRDI QIDQ3367181zbMATH OpenFDO

Authors Y. Laksmi Naidu, B. Maheswari

Publication date 23 January 2006

zbMATH Keywords

algorithminterval graphline-neighbourhood set

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Programming involving graphs or networks (90C35)

Recommendations

• The nomatic number problem in interval graphs
• The line neighbourhood number of a graph
• Neighbourhood sets in graphs
• An Optimal Algorithm to Solve 2-Neighbourhood Covering Problem on Interval Graphs
• scientific article; zbMATH DE number 772749

Cited in

(1)

• The nomatic number problem in interval graphs

This page was built for publication: Minimum line-neighbourhood set of an interval graph -- a linear time algorithm

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