Sciweavers

779 search results - page 28 / 156

» A graph polynomial for independent sets of bipartite graphs

70

FOCS
2010
IEEE

140views Theoretical Computer Science» more FOCS 2010»

Hardness of Finding Independent Sets in Almost 3-Colorable Graphs

14 years 7 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 »

72

CPC
2010

138views more CPC 2010»

The Number of Independent Sets in a Regular Graph

14 years 7 months ago

The Number of Independent Sets in a Regular Graph

Download web.mit.edu

Yufei Zhao

claim paper

Read More »

55

CORR
2011
Springer

143views Education» more CORR 2011»

On the number of maximal independent sets in a graph

14 years 4 months ago

On the number of maximal independent sets in a graph

Download www.brics.dk

David R. Wood

claim paper

Read More »

111

GC
2011
Springer

210views Applied Computing» more GC 2011»

The Number of Independent Sets in a Graph with Small Maximum Degree

14 years 4 months ago

The Number of Independent Sets in a Graph with Small Maximum Degree

Download www.nd.edu

David Galvin, Yufei Zhao

claim paper

Read More »

74

STOC
1994
ACM

125views Algorithms» more STOC 1994»

A spectral technique for coloring random 3-colorable graphs (preliminary version)

15 years 1 months ago

A spectral technique for coloring random 3-colorable graphs (preliminary version)

Download www.cs.tau.ac.il

Let G(3n, p, 3) be a random 3-colorable graph on a set of 3n vertices generated as follows. First, split the vertices arbitrarily into three equal color classes and then choose ev...

Noga Alon, Nabil Kahale

claim paper

Read More »

« Prev « First page 28 / 156 Last » Next »