Advanced search
Publication Cover
International Journal of Computer Mathematics Volume 59, 1995 - Issue 1-2
Submit an article Journal homepage
18
Views
10
CrossRef citations to date
0
Altmetric
Original Articles

Optimal sequential and parallel algorithms for computing the diameter and the center of an interval graph

Madhumangal Pal Department of Mathematics, Indian Institute of Technology, Kharagpur, 721302, India
&
G. P. Bhattacharjee Department of Mathematics, Indian Institute of Technology, Kharagpur, 721302, India
Pages 1-13 | Received 16 Feb 1995, Published online: 19 Mar 2007

Citations (10)

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 (5)

Sk Amanathulla & Madhumangal Pal. (2017) - and -labeling problems on interval graphs. AKCE International Journal of Graphs and Combinatorics 14:3, pages 205-215.
Read now
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
Anita Saha, Madhumangal Pal & Tapan K. Pal. (2005) An optimal parallel algorithm to construct a tree 3-spanner on interval graphs. International Journal of Computer Mathematics 82:3, pages 259-274.
Read now
Sukumar Mondal, Madhumangal Pal & TapanK. Pal. (2002) An Optimal Algorithm to Solve 2-Neighbourhood Covering Problem on Interval Graphs. International Journal of Computer Mathematics 79:2, pages 189-204.
Read now
B.B. Sanugi & N.B. Yaacob. (1996) A new fifth order five-stage runge-kutta method for initial value type problems in odes. International Journal of Computer Mathematics 59:3-4, pages 187-207.
Read now

Articles from other publishers (5)

Shaoli Nandi, Sukumar Mondal & Sambhu Charan Barman. (2021) Computation of diameter, radius and center of permutation graphs. Discrete Mathematics, Algorithms and Applications 14:08.
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

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.