Sciweavers

1983 search results - page 47 / 397
» Competitive graph searches
Sort
View
SAC
2004
ACM
14 years 1 months ago
Solving the maximum clique problem by k-opt local search
This paper presents a local search algorithm based on variable depth search, called the k-opt local search, for the maximum clique problem. The k-opt local search performs add and...
Kengo Katayama, Akihiro Hamamoto, Hiroyuki Narihis...
WWW
2008
ACM
14 years 8 months ago
Collaborative knowledge semantic graph image search
In this paper, we propose a Collaborative Knowledge Semantic Graphs Image Search (CKSGIS) system. It provides a novel way to conduct image search by utilizing the collaborative na...
Jyh-Ren Shieh, Yang-Ting Yeh, Chih-Hung Lin, Ching...
SIGMOD
2011
ACM
241views Database» more  SIGMOD 2011»
12 years 10 months ago
Neighborhood based fast graph search in large networks
Complex social and information network search becomes important with a variety of applications. In the core of these applications, lies a common and critical problem: Given a labe...
Arijit Khan, Nan Li, Xifeng Yan, Ziyu Guan, Supriy...
APPROX
2008
Springer
89views Algorithms» more  APPROX 2008»
13 years 9 months ago
Quantum and Randomized Lower Bounds for Local Search on Vertex-Transitive Graphs
We study the problem of local search on a graph. Given a real-valued black-box function f on the graph's vertices, this is the problem of determining a local minimum of f--a v...
Hang Dinh, Alexander Russell
ADBIS
2006
Springer
90views Database» more  ADBIS 2006»
14 years 1 months ago
Finding Communities in Site Web-Graphs and Citation Graphs
The Web is a typical example of a social network. One of the most intriguing features of the Web is its self-organization behavior, which is usually faced through the existence of ...
Antonis Sidiropoulos