Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
11
search results - page 3 / 3
»
On Universal Graphs of Minor Closed Families
Sort
relevance
views
votes
recent
update
View
thumb
title
12
click to vote
STOC
2005
ACM
96
views
Algorithms
»
more
STOC 2005
»
Every monotone graph property is testable
14 years 5 months ago
Download
www.math.tau.ac.il
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
claim paper
Read More »
« Prev
« First
page 3 / 3
Last »
Next »