Watching subgraphs to improve efficiency in maximum clique search
Data(s) |
2013
|
---|---|
Resumo |
This paper describes a new technique referred to as watched subgraphs which improves the performance of BBMC, a leading state of the art exact maximum clique solver (MCP). It is based on watched literals employed by modern SAT solvers for boolean constraint propagation. In efficient SAT algorithms, a list of clauses is kept for each literal (it is said that the clauses watch the literal) so that only those in the list are checked for constraint propagation when a (watched) literal is assigned during search. BBMC encodes vertex sets as bit strings, a bit block representing a subset of vertices (and the corresponding induced subgraph) the size of the CPU register word. The paper proposes to watch two subgraphs of critical sets during MCP search to efficiently compute a number of basic operations. Reported results validate the approach as the size and density of problem instances rise, while achieving comparable performance in the general case. |
Formato |
application/pdf |
Identificador | |
Idioma(s) |
eng |
Publicador |
E.U.I.T. Industrial (UPM) |
Relação |
http://oa.upm.es/33261/1/INVE_MEM_2013_181747.pdf http://link.springer.com/chapter/10.1007%2F978-3-319-00651-2_16 |
Direitos |
http://creativecommons.org/licenses/by-nc-nd/3.0/es/ info:eu-repo/semantics/openAccess |
Fonte |
Contemporary Challenges and Solutions in Applied Artificial Intelligence | The 26th International Conference on Industrial Engineering & Other Application of Applied Intelligent Systems (IEA/AIE) | 17-21/Junio/2013 | Amsterdam |
Palavras-Chave | #Informática |
Tipo |
info:eu-repo/semantics/conferenceObject Ponencia en Congreso o Jornada PeerReviewed |