Sciweavers

11 search results - page 3 / 3
» On Universal Graphs of Minor Closed Families
Sort
View
STOC
2005
ACM
96views Algorithms» more  STOC 2005»
14 years 5 months ago
Every monotone graph property is testable
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 ...
Noga Alon, Asaf Shapira