4171 search results - page 73 / 835 » Choice numbers of graphs |
JGT
2008
14 years 12 months ago
2008
Given a fixed multigraph H with V (H) = {h1, . . . , hm}, we say that a graph G is H-linked if for every choice of m vertices v1, . . . , vm in G, there exists a subdivision of H i...
136
click to vote
ISPASS
2005
IEEE
15 years 5 months ago
2005
IEEE
Today’s general-purpose processors are increasingly using multithreading in order to better leverage the additional on-chip real estate available with each technology generation...
SOFSEM
2007
Springer
15 years 6 months ago
2007
Springer
Digital technology is increasingly deployed in safety-critical situations. This calls for systematic design and verification methodologies that can cope with three major sources o...
115
click to vote
EJC
2006
14 years 12 months ago
2006
1 The Ramsey number R(G1, G2) is the smallest integer p such that for any graph G on p vertices2 either G contains G1 or G contains G2, where G denotes the complement of G. In this...
SAS
2004
Springer
15 years 5 months ago
2004
Springer
We describe a polynomial-time algorithm for global value numbering, which is the problem of discovering equivalences among program sub-expressions. We treat all conditionals as non...