English   español  
Por favor, use este identificador para citar o enlazar a este item: http://hdl.handle.net/10261/155822
COMPARTIR / IMPACTO:
Estadísticas
logo share SHARE logo core CORE   Add this article to your Mendeley library MendeleyBASE

Visualizar otros formatos: MARC | Dublin Core | RDF | ORE | MODS | METS | DIDL
Exportar a otros formatos:
Título

Combining Efficient Preprocessing and Incremental MaxSAT Reasoning for MaxClique in Large Graphs

AutorJiang, Hua; Li, Chu Min; Manyà, Felip
Palabras claveReasoning
MaxSAT
LMC
Large MaxClique
Fecha de publicación29-ago-2016
EditorIOS Press
Citación22nd European Conference on Artificial Intelligence, ECAI 2016; FAIA Vol. 285 (2016): 939-947
ResumenWe describe a new exact algorithm for MaxClique, called LMC (short for Large MaxClique), that is especially suited for large sparse graphs. LMC is competitive because it combines an efficient preprocessing procedure and incremental MaxSAT reasoning in a branch-and-bound scheme. The empirical results show that LMC outperforms existing exact MaxClique algorithms on large sparse graphs from real-world applications. © 2016 The Authors and IOS Press.This article is published online with Open Access by IOS Press and distributed under the terms of the Creative Commons Attribution Non-Commercial License 4.0 (CC BY-NC 4.0).
URIhttp://hdl.handle.net/10261/155822
DOI10.3233/978-1-61499-672-9-939
Identificadoresdoi: 10.3233/978-1-61499-672-9-939
isbn: 978-1-61499-672-9
Aparece en las colecciones: (IIIA) Comunicaciones congresos
Ficheros en este ítem:
Fichero Descripción Tamaño Formato  
FAIA285_939-47.null301,54 kBUnknownVisualizar/Abrir
Mostrar el registro completo
 

Artículos relacionados:


NOTA: Los ítems de Digital.CSIC están protegidos por copyright, con todos los derechos reservados, a menos que se indique lo contrario.