4171 search results - page 178 / 835 » Choice numbers of graphs |
156
click to vote
IWSOC
2003
IEEE
15 years 12 months ago
2003
IEEE
The availability of high-level design entry tooling is crucial for the viability of any reconfigurable SoC architecture. This paper presents a template generation method to extra...
217
click to vote
ACPC
1999
Springer
15 years 11 months ago
1999
Springer
Abstract. A number of techniques are described for solving sparse linear systems on parallel platforms. The general approach used is a domaindecomposition type method in which a pr...
162
click to vote
DAGSTUHL
2006
15 years 8 months ago
2006
It is known that, for every constant k 3, the presence of a k-clique (a complete subgraph on k vertices) in an n-vertex graph cannot be detected by a monotone boolean circuit usi...
285
click to vote
VL
2010
IEEE
15 years 5 months ago
2010
IEEE
— Euler diagrams are frequently used for visualizing information about collections of objects and form an important component of various visual languages. Properties possessed by...
163
click to vote
GD
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. The study of (minimally) rigid graphs is motivated by numerous applications, mostly in robotics and bioinformatics. A major open problem concerns the number of embeddings...