4171 search results - page 7 / 835 » Choice numbers of graphs |
EPEW
2008
Springer
13 years 10 months ago
2008
Springer
Currently compilers contain a large number of optimisations which are based on a set of heuristics that are not guaranteed to be effective to improve the performance metrics. In th...
COMGEO
2011
ACM
13 years 3 months ago
2011
ACM
Let P be a set of n points in the plane. A geometric proximity graph on P is a graph where two points are connected by a straight-line segment if they satisfy some prescribed prox...
MOBIS
2008
13 years 10 months ago
2008
GC
2007
Springer
13 years 8 months ago
2007
Springer
A clique is a set of pairwise adjacent vertices in a graph. We determine the maximum number of cliques in a graph for the following graph classes: (1) graphs with n vertices and m ...
SPDP
1991
IEEE
13 years 12 months ago
1991
IEEE
This paper presents several techniques for adding fault-tolerance to distributed memory parallel computers. More formally, given a target graph with n nodes, we create a fault-tol...