1056 search results - page 212 / 212 » A Probabilistic Applied Pi-Calculus |
114
click to vote
STOC
2003
ACM
16 years 3 months ago
2003
ACM
Let H be a fixed directed graph on h vertices, let G be a directed graph on n vertices and suppose that at least n2 edges have to be deleted from it to make it H-free. We show tha...