Vote for your favorite mineral in #MinCup25! - Taenite vs. Nontronite
It's a mineral found mostly in the farthest reaches of space vs one so common an exhaustive list of localities is nigh impossible as alloy #taenite faces off against clay #nontronite.
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

Alon, Noga, Kahale, Nabil (1997) A Spectral Technique for Coloring Random 3-Colorable Graphs. SIAM Journal on Computing, 26 (6). 1733-1748 doi:10.1137/s0097539794270248

Advanced
   -   Only viewable:
Reference TypeJournal (article/letter/editorial)
TitleA Spectral Technique for Coloring Random 3-Colorable Graphs
JournalSIAM Journal on Computing
AuthorsAlon, NogaAuthor
Kahale, NabilAuthor
Year1997 (December)Volume26
Issue6
PublisherSociety for Industrial & Applied Mathematics (SIAM)
DOIdoi:10.1137/s0097539794270248Search in ResearchGate
Generate Citation Formats
Mindat Ref. ID11240134Long-form Identifiermindat:1:5:11240134:8
GUID0
Full ReferenceAlon, Noga, Kahale, Nabil (1997) A Spectral Technique for Coloring Random 3-Colorable Graphs. SIAM Journal on Computing, 26 (6). 1733-1748 doi:10.1137/s0097539794270248
Plain TextAlon, Noga, Kahale, Nabil (1997) A Spectral Technique for Coloring Random 3-Colorable Graphs. SIAM Journal on Computing, 26 (6). 1733-1748 doi:10.1137/s0097539794270248
In(1997, December) SIAM Journal on Computing Vol. 26 (6) Society for Industrial & Applied Mathematics (SIAM)

See Also

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

Alon, Noga, Fischer, Eldar, Newman, Ilan (2007) Efficient Testing of Bipartite Graphs for Forbidden Induced Subgraphs. SIAM Journal on Computing, 37 (3). 959-976 doi:10.1137/050627915
MacKenzie, Philip D. (1997) The Random Adversary: A Lower-Bound Technique for Randomized Parallel Algorithms. SIAM Journal on Computing, 26 (6). 1559-1580 doi:10.1137/s0097539791224030
Alon, Noga, Coja-Oghlan, Amin, Hàn, Hiêp, Kang, Mihyun, Rödl, Vojtěch, Schacht, Mathias (2010) Quasi-Randomness and Algorithmic Regularity for Graphs with General Degree Distributions. SIAM Journal on Computing, 39 (6). 2336-2362 doi:10.1137/070709529
Alon, Noga, Kahale, Nabil (1998) Approximating the independence number via theϑ-function. Mathematical Programming, 80 (3). 253-264 doi:10.1007/bf01581168
Cole, Richard, Hopcroft, John (1982) On Edge Coloring Bipartite Graphs. SIAM Journal on Computing, 11 (3). 540-546 doi:10.1137/0211043
Alon, Noga, Karchmer, Mauricio, Wigderson, Avi (1990) Linear Circuits over $\operatorname{GF}(2)$. SIAM Journal on Computing, 19 (6). 1064-1067 doi:10.1137/0219074
Coffman, E. G., Kahale, Nabil, Leighton, F. T. (1998) Processor-Ring Communication: A Tight Asymptotic Bound on Packet Waiting Times. SIAM Journal on Computing, 27 (5). 1221-1236 doi:10.1137/s0097539794268637
Alon, Noga, Shapira, Asaf (2008) A Characterization of the (Natural) Graph Properties Testable with One-Sided Error. SIAM Journal on Computing, 37 (6). 1703-1727 doi:10.1137/06064888x
Alon, Noga, Shapira, Asaf (2008) Every Monotone Graph Property Is Testable. SIAM Journal on Computing, 38 (2). 505-522 doi:10.1137/050633445
Borchers, Al, Du, Ding-Zhu (1997) Thek-Steiner Ratio in Graphs. SIAM Journal on Computing, 26 (3). 857-869 doi:10.1137/s0097539795281086
Alon, Noga, Naor, Assaf (2006) Approximating the Cut-Norm via Grothendieck's Inequality. SIAM Journal on Computing, 35 (4). 787-803 doi:10.1137/s0097539704441629
 
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 15, 2025 08:01:18
Go to top of page