Let G =( V , E ) be a simple graph and k be a fixed positive integer. A vertex w is said to be a k -neighbourhood-cover of an edge ( u , v ) if d ( u , w ) h k and d ( v , w ) h k . A set C ³ V is called a k -neighbourhood-covering set if every edge in E is k -neighbourhood-covered by some vertices of C . This problem is NP-complete for general graphs even it remains NP-complete for chordal graphs. Using dynamic programming technique, an O ( n ) time algorithm is designed to solve minimum 2-neighbourhood-covering problem on interval graphs. A data structure called interval tree is used to solve this problem.
An Optimal Algorithm to Solve 2-Neighbourhood Covering Problem on Interval Graphs
Reprints and Corporate Permissions
Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?
To request a reprint or corporate permissions for this article, please click on the relevant link below:
Academic Permissions
Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?
Obtain permissions instantly via Rightslink by clicking on the button below:
If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.
Related research
People also read lists articles that other readers of this article have read.
Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.
Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.