Citations (7)
Keep up to date with the latest research on this topic with citation updates for this article.
Read on this site (2)
Satyabrata Paul, Madhumangal Pal & Anita Pal. (2016) A linear time algorithm to compute square of interval graphs and their colouring. AKCE International Journal of Graphs and Combinatorics 13:1, pages 54-64.
Read now
Read now
Sambhu
Charan Barman, Sukumar Mondal & Madhumangal Pal. (2010) A linear time algorithm to construct a tree 4-spanner on trapezoid graphs. International Journal of Computer Mathematics 87:4, pages 743-755.
Read now
Read now
Articles from other publishers (5)
Fernanda Couto, Luís Felipe I. Cunha, Daniel Juventude & Leandro Santiago. (2022) Strategies for generating tree spanners: Algorithms, heuristics and optimal graph classes. Information Processing Letters 177, pages 106265.
Crossref
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
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
Crossref
Sun-Yuan Hsieh. (2007) The interval-merging problem. Information Sciences 177:2, pages 519-524.
Crossref
Crossref