4171 search results - page 114 / 835 » Choice numbers of graphs |
164
click to vote
ILP
2004
Springer
15 years 11 months ago
2004
Springer
Recent statistical performance surveys of search algorithms in difficult combinatorial problems have demonstrated the benefits of randomising and restarting the search procedure. ...
182
click to vote
DM
2006
15 years 6 months ago
2006
For a chordal graph G = (V, E), we study the problem of whether a new vertex u V and a given set of edges between u and vertices in V can be added to G so that the resulting grap...
190
click to vote
ISAAC
2010
Springer
15 years 4 months ago
2010
Springer
The Induced Subgraph Isomorphism problem on two input graphs G and H is to decide whether G has an induced subgraph isomorphic to H. Already for the restricted case where H is a c...
144
click to vote
INFOCOM
2008
IEEE
16 years 25 days ago
2008
IEEE
—In a standard multiple choice hashing scheme, each item is stored in one of d ≥ 2 hash table buckets. The availability of choice in where items are stored improves space utili...
251
click to vote
ICIP
2007
IEEE
16 years 8 months ago
2007
IEEE
This paper proposes a stream authentication method based on the Generalized Butterfly Graph (GBG) framework. Compared with the original Butterfly graph, the proposed GBG graph sup...