English   español  
Please use this identifier to cite or link to this item: http://hdl.handle.net/10261/163016
logo share SHARE   Add this article to your Mendeley library MendeleyBASE
Visualizar otros formatos: MARC | Dublin Core | RDF | ORE | MODS | METS | DIDL
Exportar a otros formatos:


An Exact Algorithm for the Maximum Weight Clique Problem in Large Graphs

AuthorsJiang, Hua; Li, Chumin; Manyà, Felip
KeywordsIncremental search
Maximum weight clique problem
Issue Date4-Feb-2017
PublisherAAAI Press
CitationProceedings of the Thirty-First AAAI Conference on Artificial Intelligence and the Twenty-Ninth Innovative Applications of Artificial Intelligence Conference, AAAI 2017: 830- 838 (2017)
AbstractWe describe an exact branch-and-bound algorithm for the maximum weight clique problem (MWC), called WLMC, that is especially suited for large vertex-weighted graphs. WLMC incorporates two original contributions: a preprocessing to derive an initial vertex ordering and to reduce the size of the graph, and incremental vertex-weight splitting to reduce the number of branches in the search space. Experiments on representative large graphs from real-world applications show that WLMC greatly outperforms relevant exact and heuristic MWC algorithms, and refute the prevailing hypothesis that exact MWC algorithms are less adequate for large graphs than heuristic algorithms. Copyright © 2017, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved.
Identifiersisbn: 978-1-57735-780-3
uri: https://aaai.org/ocs/index.php/AAAI/AAAI17/paper/view/14370
Appears in Collections:(IIIA) Comunicaciones congresos
Files in This Item:
File Description SizeFormat 
accesoRestringido.pdf15,38 kBAdobe PDFThumbnail
Show full item record
Review this work

WARNING: Items in Digital.CSIC are protected by copyright, with all rights reserved, unless otherwise indicated.