4171 search results - page 60 / 835 » Choice numbers of graphs |
GD
2006
Springer
15 years 3 months ago
2006
Springer
We give a brief account of results concerning the number of triangulations on finite point sets in the plane, both for arbitrary sets and for specific sets such as the n
136
click to vote
COMPSYSTECH
2011
13 years 11 months ago
2011
Abstract. In a software watermarking environment, several graph theoretic watermark methods encode the watermark values as graph structures and embed them in application programs. ...
GD
2007
Springer
15 years 6 months ago
2007
Springer
We prove that the crossing number of a graph decays in a “continuous fashion” in the following sense. For any ε > 0 there is a δ > 0 such that for n sufficiently large...
104
click to vote
CG
2008
Springer
15 years 1 months ago
2008
Springer
Abstract. Depth-first proof-number (df-pn) search is a powerful member of the family of algorithms based on proof and disproof numbers. While df-pn has succeeded in practice, its t...
100
click to vote
CIE
2007
Springer
15 years 6 months ago
2007
Springer
In the framework of parameterized complexity, exploring how one parameter affects the complexity of a different parameterized (or unparameterized problem) is of general interest....