Sciweavers

721 search results - page 6 / 145
» Almost universal graphs
Sort
View
FOCS
2010
IEEE
13 years 5 months ago
Hardness of Finding Independent Sets in Almost 3-Colorable Graphs
Irit Dinur, Subhash Khot, Will Perkins, Muli Safra
FUIN
2010
67views more  FUIN 2010»
13 years 4 months ago
Properties of Almost All Graphs and Generalized Quantifiers
We study 0-1 laws for extensions of first-order logic by Lindstr
Anuj Dawar, Erich Grädel
JCT
2011
75views more  JCT 2011»
13 years 2 months ago
The structure of almost all graphs in a hereditary property
Noga Alon, József Balogh, Béla Bollo...
STOC
2010
ACM
295views Algorithms» more  STOC 2010»
14 years 8 days ago
Approximation Schemes for Steiner Forest on Planar Graphs and Graphs of Bounded Treewidth
We give the first polynomial-time approximation scheme (PTAS) for the Steiner forest problem on planar graphs and, more generally, on graphs of bounded genus. As a first step, w...
MohammadHossein Bateni, MohammadTaghi Hajiaghayi a...