CORR
2008
Springer
13 years 4 months ago
2008
Springer
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...
IPPS
1998
IEEE
13 years 8 months ago
1998
IEEE
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...
COCOON
2003
Springer
13 years 9 months ago
2003
Springer
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...
SIES
2008
IEEE
13 years 10 months ago
2008
IEEE
—Distributed, time-triggered communication based on FlexRay is likely to become an enabler for future safety related applications in the automotive domain. Prior to series deploy...