Vote for your favorite mineral in #MinCup25! - Pectolite vs. Haüyne
It's a pair of striking blue beauties as #pectolite the uncrushable faces off against #hauyne, the phoenix from volcanic ashes!
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

He, Xin (1988) A nearly optimal parallel algorithm for constructing maximal independent set in planar graphs. Theoretical Computer Science, 61 (1). 33-47 doi:10.1016/0304-3975(88)90106-5

Advanced
   -   Only viewable:
Reference TypeJournal (article/letter/editorial)
TitleA nearly optimal parallel algorithm for constructing maximal independent set in planar graphs
JournalTheoretical Computer Science
AuthorsHe, XinAuthor
Year1988 (October)Volume61
Issue1
PublisherElsevier BV
DOIdoi:10.1016/0304-3975(88)90106-5Search in ResearchGate
Generate Citation Formats
Mindat Ref. ID6536627Long-form Identifiermindat:1:5:6536627:3
GUID0
Full ReferenceHe, Xin (1988) A nearly optimal parallel algorithm for constructing maximal independent set in planar graphs. Theoretical Computer Science, 61 (1). 33-47 doi:10.1016/0304-3975(88)90106-5
Plain TextHe, Xin (1988) A nearly optimal parallel algorithm for constructing maximal independent set in planar graphs. Theoretical Computer Science, 61 (1). 33-47 doi:10.1016/0304-3975(88)90106-5
In(1988) Theoretical Computer Science Vol. 61. Elsevier BV

See Also

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

He, Xin, Yesha, Yaacov (1988) A Nearly Optimal Parallel Algorithm for Constructing Depth First Spanning Trees in Planar Graphs. SIAM Journal on Computing, 17 (3). 486-491 doi:10.1137/0217028
Chen, Zhi-Zhong (1995) The maximal f-dependent set problem for planar graphs is in NC. Theoretical Computer Science, 143 (2). 309-318 doi:10.1016/0304-3975(94)00112-v
He, Xin (1990) An efficient algorithm for edge coloring planar graphs with Δ colors. Theoretical Computer Science, 74 (3). 299-312 doi:10.1016/0304-3975(90)90079-w
Srikrishna, G., Rangan, C.Pandu (1995) Optimal parallel algorithms for path problems on planar graphs. Theoretical Computer Science, 145 (1). 27-43 doi:10.1016/0304-3975(94)00189-p
Tarhio, Jorma, Ukkonen, Esko (1988) A greedy approximation algorithm for constructing shortest common superstrings. Theoretical Computer Science, 57 (1). 131-145 doi:10.1016/0304-3975(88)90167-3
Dahlhaus, Elias, Karpinski, Marek (1988) Parallel construction of perfect matchings and Hamiltonian cycles on dense graphs. Theoretical Computer Science, 61 (2). 121-136 doi:10.1016/0304-3975(88)90120-x
(1988) Editorial Board. Theoretical Computer Science, 61 (1). doi:10.1016/0304-3975(88)90102-8
Varman, Peter, Doshi, Kshitij (1988) An efficient parallel algorithm for updating minimum spanning trees. Theoretical Computer Science, 58 (1). 379-397 doi:10.1016/0304-3975(88)90035-7
Shoudai, Takayoshi, Miyano, Satoru (1995) Using maximal independent sets to solve problems in parallel. Theoretical Computer Science, 148 (1). 57-65 doi:10.1016/0304-3975(94)00221-4
Nummenmaa, J. (1992) Constructing compact rectiliner planar layouts using canonical representation of planar graphs. Theoretical Computer Science, 99 (2). 213-230 doi:10.1016/0304-3975(92)90349-k
Megiddo, Nimrod, Vishkin, Uzi (1988) On finding a minimum dominating set in a tournament. Theoretical Computer Science, 61 (2). 307-316 doi:10.1016/0304-3975(88)90131-4
 
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 17, 2025 03:39:45
Go to top of page