Vote for your favorite mineral in #MinCup25! - Jeremejevite vs. Haüyne
Are you ready for a battle of the blues? In a match of newcomers, volcanic gem hauyne is taking on rare jeremejevite.
Log InRegister
Quick Links : The Mindat ManualThe Rock H. Currier Digital LibraryMindat Newsletter [Free Download]
Home PageAbout MindatThe Mindat ManualHistory of MindatCopyright StatusWho We AreContact UsAdvertise on Mindat
Donate to MindatCorporate SponsorshipSponsor a PageSponsored PagesMindat AdvertisersAdvertise on Mindat
Learning CenterWhat is a mineral?The most common minerals on earthInformation for EducatorsMindat ArticlesThe ElementsThe Rock H. Currier Digital LibraryGeologic Time
Minerals by PropertiesMinerals by ChemistryAdvanced Locality SearchRandom MineralRandom LocalitySearch by minIDLocalities Near MeSearch ArticlesSearch GlossaryMore Search Options
Search For:
Mineral Name:
Locality Name:
Keyword(s):
 
The Mindat ManualAdd a New PhotoRate PhotosLocality Edit ReportCoordinate Completion ReportAdd Glossary Item
Mining CompaniesStatisticsUsersMineral MuseumsClubs & OrganizationsMineral Shows & EventsThe Mindat DirectoryDevice SettingsThe Mineral Quiz
Photo SearchPhoto GalleriesSearch by ColorNew Photos TodayNew Photos YesterdayMembers' Photo GalleriesPast Photo of the Day GalleryPhotography

Mondal, Sukumar, Pal, Madhumangal, Pal, Tapan (2003) Optimal Sequential And Parallel Algorithms To Compute A Steiner Tree On Permutation Graphs. International Journal of Computer Mathematics, 80. 937-943 doi:10.1080/0020716031000112330

Advanced
   -   Only viewable:
Reference TypeJournal (article/letter/editorial)
TitleOptimal Sequential And Parallel Algorithms To Compute A Steiner Tree On Permutation Graphs
JournalInternational Journal of Computer Mathematics
AuthorsMondal, SukumarAuthor
Pal, MadhumangalAuthor
Pal, TapanAuthor
Year2003 (August)Volume80
PublisherInforma UK Limited
DOIdoi:10.1080/0020716031000112330Search in ResearchGate
Generate Citation Formats
Mindat Ref. ID6644803Long-form Identifiermindat:1:5:6644803:3
GUID0
Full ReferenceMondal, Sukumar, Pal, Madhumangal, Pal, Tapan (2003) Optimal Sequential And Parallel Algorithms To Compute A Steiner Tree On Permutation Graphs. International Journal of Computer Mathematics, 80. 937-943 doi:10.1080/0020716031000112330
Plain TextMondal, Sukumar, Pal, Madhumangal, Pal, Tapan (2003) Optimal Sequential And Parallel Algorithms To Compute A Steiner Tree On Permutation Graphs. International Journal of Computer Mathematics, 80. 937-943 doi:10.1080/0020716031000112330
In(n.d.) International Journal of Computer Mathematics Vol. 80. Informa UK Limited

See Also

These are possibly similar items as determined by title/reference text matching only.

Bera, Debashis, Pal, Tapan K., Pal, Madhumangal (1999) An optimal parallel algorithm to compute all cutvertices and blocks on permutation graphs. International Journal of Computer Mathematics, 72. 449-462 doi:10.1080/00207169908804868
Pal, Madhumangal, Mondal, Sukumar, Bera, Debashis, Pal, Tapan K. (2000) An optimal parallel algorithm for computing cut vertices and blocks on interval graphs. International Journal of Computer Mathematics, 75. 59-70 doi:10.1080/00207160008804965
Mondal, Sukumar, Pal, Madhumangal, Pal, Tapan K. (2002) An Optimal Algorithm to Solve 2-Neighbourhood Covering Problem on Interval Graphs. International Journal of Computer Mathematics, 79. 189-204 doi:10.1080/00207160211921
Saha, Anita, Pal, Madhumangal, Pal, Tapan K. (2005) An optimal parallel algorithm to construct a tree 3-spanner on interval graphs. International Journal of Computer Mathematics, 82. 259-274 doi:10.1080/00207160412331286851
Hota, Mrinmoy, Pal, Madhumangal, Pal, Tapan K. (2004) Optimal Sequential and Parallel Algorithms to Compute All Cut Vertices on Trapezoid Graphs. Computational Optimization and Applications, 27 (1). 95-113 doi:10.1023/b:coap.0000004982.13444.bc
Barman, Sambhu Charan, Mondal, Sukumar, Pal, Madhumangal (2010) A linear time algorithm to construct a tree 4-spanner on trapezoid graphs. International Journal of Computer Mathematics, 87. 743-755 doi:10.1080/00207160802037880
Saha, Anita, Pal, Madhumangal (2003) Maximum weightk-independent set problem on permutation graphs. International Journal of Computer Mathematics, 80. 1477-1487 doi:10.1080/00207160310001614972
Pal, Madhumangal. (1998) A parallel algorithm to generate all maximal independent sets on permutation graphs. International Journal of Computer Mathematics, 67. 261-274 doi:10.1080/00207169808804664
Barman, Sambhu Charan, Pal, Madhumangal, Mondal, Sukumar (2010) Thek-neighbourhood-covering problem on interval graphs. International Journal of Computer Mathematics, 87. 1918-1935 doi:10.1080/00207160802676570
Bera, Debashis, Pal, Madhumangal, Pal, Tapan (2002) An Efficient Algorithm to Generate all Maximal Cliques on Trapezoid Graphs. International Journal of Computer Mathematics, 79. 1057-1065 doi:10.1080/00207160212707
Hota, Marinmoy, Pal, Madhumangal, Pal, Tapan K. (1999) An efficient algorithm to generate all maximal independent sets on trapezoid graphs. International Journal of Computer Mathematics, 70. 587-599 doi:10.1080/00207169908804777
 
and/or  
Mindat.org is an outreach project of the Hudson Institute of Mineralogy, a 501(c)(3) not-for-profit organization.
Copyright © mindat.org and the Hudson Institute of Mineralogy 1993-2025, except where stated. Most political location boundaries are © OpenStreetMap contributors. Mindat.org relies on the contributions of thousands of members and supporters. Founded in 2000 by Jolyon Ralph.
To cite: Ralph, J., Von Bargen, D., Martynov, P., Zhang, J., Que, X., Prabhu, A., Morrison, S. M., Li, W., Chen, W., & Ma, X. (2025). Mindat.org: The open access mineralogy database to accelerate data-intensive geoscience research. American Mineralogist, 110(6), 833–844. doi:10.2138/am-2024-9486.
Privacy Policy - Terms & Conditions - Contact Us / DMCA issues - Report a bug/vulnerability Current server date and time: September 3, 2025 21:06:05
Go to top of page