Advanced search
Publication Cover
International Journal of Computer Mathematics Volume 79, 2002 - Issue 2
Submit an article Journal homepage
30
Views
7
CrossRef citations to date
0
Altmetric
Original Articles

An Optimal Algorithm to Solve 2-Neighbourhood Covering Problem on Interval Graphs

Sukumar Mondal Department of Applied Mathematics with Oceanology and Computer Programming, Vidyasagar University, Midnapore, 721 102, India
,
Madhumangal Pal Department of Applied Mathematics with Oceanology and Computer Programming, Vidyasagar University, Midnapore, 721 102, India
&
Tapan K. Pal Department of Applied Mathematics with Oceanology and Computer Programming, Vidyasagar University, Midnapore, 721 102, India
Pages 189-204 | Published online: 15 Sep 2010

Citations (7)

Keep up to date with the latest research on this topic with citation updates for this article.

Subscribe to citation updates

Read on this site (1)

Sambhu Charan Barman, Madhumangal Pal & Sukumar Mondal. (2010) The k-neighbourhood-covering problem on interval graphs. International Journal of Computer Mathematics 87:9, pages 1918-1935.
Read now

Articles from other publishers (6)

Amita Samanta Adhya, Sukumar Mondal & Sambhu Charan Barman. (2021) Minimum r-neighborhood covering set of permutation graphs. Discrete Mathematics, Algorithms and Applications 13:06.
Crossref
Madhumangal Pal. 2020. Handbook of Research on Advanced Applications of Graph Theory in Modern Society. Handbook of Research on Advanced Applications of Graph Theory in Modern Society 24 65 .
Sambhu Charan Barman, Madhumangal Pal & Sukumar Mondal. (2019) An optimal algorithm to find minimum k-hop dominating set of interval graphs. Discrete Mathematics, Algorithms and Applications 11:02, pages 1950016.
Crossref
Satyabrata Paul, Madhumangal Pal & Anita Pal. (2014) L(2,1)-labeling of interval graphs. Journal of Applied Mathematics and Computing 49:1-2, pages 419-432.
Crossref
Tarasankar Pramanik, Sukumar Mondal & Madhumangal Pal. (2011) Minimum 2-Tuple Dominating Set of an Interval Graph. International Journal of Combinatorics 2011, pages 1-14.
Crossref
Sun-Yuan Hsieh. (2007) The interval-merging problem. Information Sciences 177:2, pages 519-524.
Crossref

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:

Order Reprints Request Corporate Permissions

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:

Request Academic Permissions

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.