53 search results - page 11 / 11 » Bounds on the forcing numbers of bipartite graphs |
GD
2005
Springer
13 years 11 months ago
2005
Springer
Most graph layout algorithms treat nodes as points. The problem of node overlap removal is to adjust the layout generated by such methods so that nodes of non-zero width and height...
CRYPTO
2007
Springer
13 years 12 months ago
2007
Springer
A public random function is a random function that is accessible by all parties, including the adversary. For example, a (public) random oracle is a public random function {0, 1}â...
SIGSOFT
2003
ACM
14 years 6 months ago
2003
ACM
Automated finite-state verification techniques have matured considerably in the past several years, but state-space explosion remains an obstacle to their use. Theoretical lower b...