25 search results - page 1 / 5 » An investigation of the clique problem in FlexRay |
SIES
2008
IEEE
13 years 11 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...
SWAT
1994
Springer
13 years 8 months ago
1994
Springer
A graph is distance-hereditary if and only if each cycle on five or more vertices has at least two crossing chords. We present linear time algorithms for the minimum r-dominating c...
CATS
2008
13 years 6 months ago
2008
The problem of deciding whether the edge-set of a given graph can be partitioned into at most k cliques is well known to be NP-complete. In this paper we investigate this problem ...
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...
HEURISTICS
2006
13 years 4 months ago
2006
This paper investigates the capabilities of the Ant Colony Optimization (ACO) meta-heuristic for solving the maximum clique problem, the goal of which is to find a largest set of ...