Advanced search
Publication Cover
International Journal of Computer Mathematics Volume 80, 2003 - Issue 8
Submit an article Journal homepage
24
Views
3
CrossRef citations to date
0
Altmetric
Original Articles

Optimal Sequential And Parallel Algorithms To Compute A Steiner Tree On Permutation Graphs

Sukumar Mondal Department of Applied Mathematics with Oceanology and Computer Programming, Vidyasagar University, Midnapore, 721 102, West Bengal, India
,
Madhumangal Pal Department of Applied Mathematics with Oceanology and Computer Programming, Vidyasagar University, Midnapore, 721 102, West Bengal, India
&
Tapan Pal Department of Applied Mathematics with Oceanology and Computer Programming, Vidyasagar University, Midnapore, 721 102, West Bengal, India
Pages 937-943 | Published online: 15 Sep 2010

  • Arvind , K. and Pandu Rangan , C. 1992 . Connected domination and Steiner set on weighted permutation graphs . Information Processing Letters , 41 : 215 – 220 .
  • Arvind , K. , Kamakoti , V. and Pandu Rangan , C. 1999 . Efficient parallel algorithms for permutation graphs . J. Parallel and Distributed Computing , 26 : 116 – 124 .
  • Chao , H. S. , Hsu , F. R. and Lee , R. C. T. 1997 . An optimal EREW parallel algorithm for computing breadth-first search bees on permutation graphs . Information Processing Letters , 61 : 311 – 316 .
  • Colbourn , C. J. and Stewart , L. K. 1990 . Permutation graphs: Connected domination and Steiner trees . Discrete Math. , 86 : 145 – 164 .
  • Deo , N. 1990 . Graph Theory with Applications to Engineering and Computer Science , New Delhi : Prentice Hall of India .
  • D'Atri , A. and Mascarini , M. 1988 . Distance hereditary graphs, Steiner trees and connected domination . SIAM J. Comput. , 17 : 521 – 538 .
  • Golumbic , M. C. 1980 . Algorithmic Graph Theory and Perfect Graphs , New York : Academic Press .
  • Hedetniemi , S. T. and Laskar , R. C. , eds. 1991 . Topics on domination. Annals of Discrete Mathematics , Vol 48 , 145 – 164 . Amsterdam : North-Holland .
  • JáJá , J. 1992 . An Introduction to Parallel Algorithms , Reading, MA : Addison-Wesley .
  • Kruskal , C. P. , Rodolph , L. and Snir , M. 1985 . The power of parallel prefix . IEEE Trans. Comput. , 34 : 965 – 968 .
  • Muller , J. H. and Spinrad , J. 1989 . Incremental modular decomposition . J. ACM , 36 : 1 – 19 .
  • Pnueli , A. , Lempel , A. and Even , S. 1971 . Transitive orientation of graphs and identification of permutation graphs . Canad. J. Math. , 23 : 160 – 175 .
  • Rhee , C. , Liang , Y. D. , Dhall , S. K. and Lakshmivarahan , S. 1994 . Efficient algorithms for finding depth-first and breadth-first search trees in permutation graphs . Information Processing Letters , 49 : 45 – 50 .
  • Wang , Y.-L. , Chen , H.-C. and Lee , C.-Y. 1995 . An O(log n} parallel algorithm for constructing a spanning tree on permutation graphs . Information Processing Letters , 56 : 83 – 87 .
  • White , K. , Farber , M. and Pulleyblank , W. R. 1985 . Steiner trees, connected domination and strongly chorda! graphs . Networks , 15 : 109 – 124 .

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.