Sciweavers

252 search results - page 3 / 51
» Decremental Clique Problem
Sort
View
IPPS
1998
IEEE
13 years 10 months ago
Solving the Maximum Clique Problem Using PUBB
Given an (undirected) graph G = V; E; a clique of G is a subset of vertices in which every pair is connected by an edge. The problem of finding a clique of maximum size is a class...
Yuji Shinano, Tetsuya Fujie, Yoshiko Ikebe, Ryuich...
JMLR
2012
11 years 8 months ago
Detecting Network Cliques with Radon Basis Pursuit
In this paper, we propose a novel formulation of the network clique detection problem by introducing a general network data representation framework. We show connections between o...
Xiaoye Jiang, Yuan Yao, Han Liu, Leonidas J. Guiba...
COCOON
2003
Springer
13 years 11 months ago
Matroid Representation of Clique Complexes
In this paper, we approach the quality of a greedy algorithm for the maximum weighted clique problem from the viewpoint of matroid theory. More precisely, we consider the clique c...
Kenji Kashiwabara, Yoshio Okamoto, Takeaki Uno
CORR
2008
Springer
110views Education» more  CORR 2008»
13 years 6 months ago
Finding Dense Subgraphs in G(n,1/2)
Finding the largest clique in random graphs is a well known hard problem. It is known that a random graph G(n, 1/2) almost surely has a clique of size about 2 log n. A simple greed...
Atish Das Sarma, Amit Deshpande, Ravi Kannan
CVPR
2012
IEEE
11 years 8 months ago
Maximum weight cliques with mutex constraints for video object segmentation
In this paper, we address the problem of video object segmentation, which is to automatically identify the primary object and segment the object out in every frame. We propose a n...
Tianyang Ma, Longin Jan Latecki