2 search results - page 1 / 1 » A characterization of easily testable induced subgraphs |
SODA
2004
ACM
14 years 6 days ago
2004
ACM
Let H be a fixed graph on h vertices. We say that a graph G is induced H-free if it does not contain any induced copy of H. Let G be a graph on n vertices and suppose that at leas...
STOC
2005
ACM
14 years 11 months ago
2005
ACM
A graph property is called monotone if it is closed under taking (not necessarily induced) subgraphs (or, equivalently, if it is closed under removal of edges and vertices). Many ...