Sciweavers

721 search results - page 6 / 145

» Almost universal graphs

77

COMBINATORICA
2004

83views more COMBINATORICA 2004»

Almost Covers Of 2-Arc Transitive Graphs

15 years 1 months ago

Almost Covers Of 2-Arc Transitive Graphs

Download www.ms.unimelb.edu.au

Sanming Zhou

claim paper

Read More »

107

FOCS
2010
IEEE

140views Theoretical Computer Science» more FOCS 2010»

Hardness of Finding Independent Sets in Almost 3-Colorable Graphs

14 years 12 months ago

Hardness of Finding Independent Sets in Almost 3-Colorable Graphs

Download www.cims.nyu.edu

Irit Dinur, Subhash Khot, Will Perkins, Muli Safra

claim paper

Read More »

110

FUIN
2010

67views more FUIN 2010»

Properties of Almost All Graphs and Generalized Quantifiers

14 years 11 months ago

Properties of Almost All Graphs and Generalized Quantifiers

Download logic.rwth-aachen.de

We study 0-1 laws for extensions of first-order logic by Lindstr

Anuj Dawar, Erich Grädel

claim paper

Read More »

80

JCT
2011

75views more JCT 2011»

The structure of almost all graphs in a hereditary property

14 years 8 months ago

The structure of almost all graphs in a hereditary property

Download www.math.ucsd.edu

Noga Alon, József Balogh, Béla Bollo...

claim paper

Read More »

133

STOC
2010
ACM

295views Algorithms» more STOC 2010»

Approximation Schemes for Steiner Forest on Planar Graphs and Graphs of Bounded Treewidth

15 years 6 months ago

Approximation Schemes for Steiner Forest on Planar Graphs and Graphs of Bounded Treewidth

Download www.cs.bme.hu

We give the ﬁrst polynomial-time approximation scheme (PTAS) for the Steiner forest problem on planar graphs and, more generally, on graphs of bounded genus. As a ﬁrst step, w...

MohammadHossein Bateni, MohammadTaghi Hajiaghayi a...

claim paper

Read More »

« Prev « First page 6 / 145 Last » Next »