4171 search results - page 7 / 835 » Choice numbers of graphs |
147
click to vote
EPEW
2008
Springer
15 years 5 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...
167
click to vote
COMGEO
2011
ACM
14 years 11 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...
143
click to vote
GC
2007
Springer
15 years 3 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 ...
133
click to vote
SPDP
1991
IEEE
15 years 7 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...