Show simple item record

dc.contributor.authorPullan, Wayneen_US
dc.contributor.authorH. Hoos, Holgeren_US
dc.date.accessioned2017-05-03T13:58:22Z
dc.date.available2017-05-03T13:58:22Z
dc.date.issued2006en_US
dc.date.modified2008-02-19T06:03:39Z
dc.identifier.issn1076-9757en_US
dc.identifier.urihttp://hdl.handle.net/10072/14393
dc.description.abstractIn this paper, we introduce DLS-MC, a new stochastic local search algorithm for the maximum clique problem. DLS-MC alternates between phases of iterative improvement, during which suitable vertices are added to the current clique, and plateau search, during which vertices of the current clique are swapped with vertices not contained in the current clique. The selection of vertices is solely based on vertex penalties that are dynamically adjusted during the search, and a perturbation mechanism is used to overcome search stagnation. The behaviour of DLS-MC is controlled by a single parameter, penalty delay, which controls the frequency at which vertex penalties are reduced. We show empirically that DLSMC achieves substantial performance improvements over state-of-the-art algorithms for the maximum clique problem over a large range of the commonly used DIMACS benchmark instances.en_US
dc.description.peerreviewedYesen_US
dc.description.publicationstatusYesen_AU
dc.format.extent469238 bytes
dc.format.mimetypeapplication/pdf
dc.languageEnglishen_US
dc.language.isoen_AU
dc.publisherAAAI Pressen_US
dc.publisher.placeUSAen_US
dc.publisher.urihttp://www.jair.org/en_AU
dc.relation.ispartofstudentpublicationNen_AU
dc.relation.ispartofpagefrom159en_US
dc.relation.ispartofpageto185en_US
dc.relation.ispartofjournalJournal of Artificial Intelligence Researchen_US
dc.relation.ispartofvolume25en_US
dc.rights.retentionYen_AU
dc.subject.fieldofresearchcode280213en_US
dc.titleDynamic Local Search for the Maximum Clique Problemen_US
dc.typeJournal articleen_US
dc.type.descriptionC1 - Peer Reviewed (HERDC)en_US
dc.type.codeC - Journal Articlesen_US
gro.facultyGriffith Sciences, School of Information and Communication Technologyen_US
gro.rights.copyrightCopyright 2006 A I Access Foundation, Inc. The attached file is reproduced here in accordance with the copyright policy of the publisher. Please refer to the journal's website for access to the definitive, published version.en_AU
gro.date.issued2006
gro.hasfulltextFull Text


Files in this item

This item appears in the following Collection(s)

  • Journal articles
    Contains articles published by Griffith authors in scholarly journals.

Show simple item record