Searching for a k-clique in unknown graphs

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

4 Scopus citations

Abstract

Agents that solve problems in unknown graphs are usually required to iteratively explore parts of the graph. In this paper we research the problem of finding a k-clique in an unknown graph while minimizing the number of required exploration actions. Two novel heuristics (KnownDegree and Clique*) are proposed to reduce the required exploration cost by carefully choosing which part of the environment to explore. We further investigate the problem by adding probabilistic knowledge of the graph and propose an Markov Decision Process(MDP) and a Monte Carlo based heuristic (RClique*) that uses knowledge of edge probabilities to reduce the required exploration cost. We demonstrate the efficiency of the proposed approaches on simulated random and scale free graphs as well as on real online web crawls.

Original languageEnglish
Title of host publicationProceedings of the 3rd Annual Symposium on Combinatorial Search, SoCS 2010
Pages83-89
Number of pages7
StatePublished - 1 Dec 2010
Event3rd International Symposium on Combinatorial Search, SoCS 2010 - Atlanta, GA, United States
Duration: 8 Jul 201010 Jul 2010

Publication series

NameProceedings of the 3rd Annual Symposium on Combinatorial Search, SoCS 2010

Conference

Conference3rd International Symposium on Combinatorial Search, SoCS 2010
Country/TerritoryUnited States
CityAtlanta, GA
Period8/07/1010/07/10

ASJC Scopus subject areas

  • Computer Networks and Communications

Fingerprint

Dive into the research topics of 'Searching for a k-clique in unknown graphs'. Together they form a unique fingerprint.

Cite this