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

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

Advanced
   -   Only viewable:
Reference TypeJournal (article/letter/editorial)
TitleParallel construction of perfect matchings and Hamiltonian cycles on dense graphs
JournalTheoretical Computer Science
AuthorsDahlhaus, EliasAuthor
Karpinski, MarekAuthor
Year1988 (November)Volume61
Issue2
PublisherElsevier BV
DOIdoi:10.1016/0304-3975(88)90120-xSearch in ResearchGate
Generate Citation Formats
Mindat Ref. ID6536633Long-form Identifiermindat:1:5:6536633:4
GUID0
Full ReferenceDahlhaus, 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
Plain TextDahlhaus, 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
In(1988) Theoretical Computer Science Vol. 61. Elsevier BV

See Also

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

Dahlhaus, Elias, Karpinski, Marek (1994) An efficient parallel algorithm for the minimal elimination ordering (MEO) of an arbitrary graph. Theoretical Computer Science, 134 (2). 493-528 doi:10.1016/0304-3975(94)90250-x
Dahlhaus, Elias, Karpinski, Marek (1992) Perfect matching for regular graphs is AC0-hard for the general matching problem. Journal of Computer and System Sciences, 44. 94-102 doi:10.1016/0022-0000(92)90005-4
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
(1988) Author index volume 61 (1988). Theoretical Computer Science, 61 (2). 321pp. doi:10.1016/0304-3975(88)90133-8
Kennaway, Richard (1988) On “on graph rewritings”. Theoretical Computer Science, 61 (2). 317-320 doi:10.1016/0304-3975(88)90132-6
Karpinski, Marek, Shparlinski, Igor (1996) On some approximation problems concerning sparse polynomials over finite fields. Theoretical Computer Science, 157 (2). 259-266 doi:10.1016/0304-3975(95)00162-x
(1988) Editorial Board. Theoretical Computer Science, 61 (1). doi:10.1016/0304-3975(88)90102-8
Fournier, J.C. (2003) Combinatorics of perfect matchings in plane bipartite graphs and application to tilings. Theoretical Computer Science, 303 (2). 333-351 doi:10.1016/s0304-3975(02)00496-6
Malgouyres, RĂ©my (1995) Graphs generalizing closed curves with linear construction of the Hamiltonian cycle. Theoretical Computer Science, 143 (2). 189-249 doi:10.1016/0304-3975(94)00134-5
Teng, Shang-Hua (1995) Independent sets versus perfect matchings. Theoretical Computer Science, 145 (1). 381-390 doi:10.1016/0304-3975(94)00289-u
Edwards, Keith (1986) The complexity of colouring problems on dense graphs. Theoretical Computer Science, 43. 337-343 doi:10.1016/0304-3975(86)90184-2
 
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:22:47
Go to top of page