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

Stix, Volker (2004) Finding All Maximal Cliques in Dynamic Graphs. Computational Optimization and Applications, 27 (2). 173-186 doi:10.1023/b:coap.0000008651.28952.b6

Advanced
   -   Only viewable:
Reference TypeJournal (article/letter/editorial)
TitleFinding All Maximal Cliques in Dynamic Graphs
JournalComputational Optimization and Applications
AuthorsStix, VolkerAuthor
Year2004 (February)Volume27
Issue2
PublisherSpringer Science and Business Media LLC
DOIdoi:10.1023/b:coap.0000008651.28952.b6Search in ResearchGate
Generate Citation Formats
Mindat Ref. ID9538431Long-form Identifiermindat:1:5:9538431:9
GUID0
Full ReferenceStix, Volker (2004) Finding All Maximal Cliques in Dynamic Graphs. Computational Optimization and Applications, 27 (2). 173-186 doi:10.1023/b:coap.0000008651.28952.b6
Plain TextStix, Volker (2004) Finding All Maximal Cliques in Dynamic Graphs. Computational Optimization and Applications, 27 (2). 173-186 doi:10.1023/b:coap.0000008651.28952.b6
In(2004, February) Computational Optimization and Applications Vol. 27 (2) Springer Science and Business Media LLC

See Also

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

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
Rosen, J. Ben, Marcia, Roummel F. (2004) Convex Quadratic Approximation. Computational Optimization and Applications, 28 (2). 173-184 doi:10.1023/b:coap.0000026883.13660.84
(2004) COAP Best Paper Award. Computational Optimization and Applications, 27 (1). 115pp. doi:10.1023/b:coap.0000005029.22801.b3
Griva, Igor (2004) Numerical Experiments with an Interior-Exterior Point Method for Nonlinear Programming. Computational Optimization and Applications, 29 (2). 173-195 doi:10.1023/b:coap.0000042029.73199.83
Fortz, B., Labbé, M. (2004) Two-Connected Networks with Rings of Bounded Cardinality. Computational Optimization and Applications, 27 (2). 123-148 doi:10.1023/b:coap.0000008649.61438.6b
Larsson, Torbjörn, Yuan, Di (2004) An Augmented Lagrangian Algorithm for Large Scale Multicommodity Routing. Computational Optimization and Applications, 27 (2). 187-215 doi:10.1023/b:coap.0000008652.29295.eb
Walkowiak, Krzysztof M. (2004) A Branch and Bound Algorithm for Primary Routes Assignment in Survivable Connection Oriented Networks. Computational Optimization and Applications, 27 (2). 149-171 doi:10.1023/b:coap.0000008650.91314.59
Demetriou, I.C. (2004) Least Squares Convex-Concave Data Smoothing. Computational Optimization and Applications, 29 (2). 197-217 doi:10.1023/b:coap.0000042030.54793.47
Albrecht, Andreas, Wong, Chak-Kuen (2004) Approximation of Boolean Functions by Local Search. Computational Optimization and Applications, 27 (1). 53-82 doi:10.1023/b:coap.0000004980.80957.05
Zhang, J.Z., Yang, X.G., Cai, M.C. (2004) A Network Improvement Problem Under Different Norms. Computational Optimization and Applications, 27 (3). 305-319 doi:10.1023/b:coap.0000013061.17529.79
Bergamaschi, Luca, Gondzio, Jacek, Zilli, Giovanni (2004) Preconditioning Indefinite Systems in Interior Point Methods for Optimization. Computational Optimization and Applications, 28 (2). 149-171 doi:10.1023/b:coap.0000026882.34332.1b
 
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: August 30, 2025 02:21:04
Go to top of page