Search Sciweavers | Sciweavers

779 search results - page 26 / 156

» A graph polynomial for independent sets of bipartite graphs

126

click to vote

COCO
2001
Springer

101views Algorithms» more COCO 2001»

Resolution Complexity of Independent Sets in Random Graphs

15 years 10 months ago

Download www.cs.cornell.edu

Paul Beame, Russell Impagliazzo, Ashish Sabharwal

claim paper

Read More »

132

click to vote

WADS
2001
Springer

106views Algorithms» more WADS 2001»

Small Maximal Independent Sets and Faster Exact Graph Coloring

15 years 10 months ago

Download www.ics.uci.edu

David Eppstein

claim paper

Read More »

109

click to vote

FOCS
1999
IEEE

70views Theoretical Computer Science» more FOCS 1999»

On Counting Independent Sets in Sparse Graphs

15 years 10 months ago

Download www.lfcs.inf.ed.ac.uk

Martin E. Dyer, Alan M. Frieze, Mark Jerrum

claim paper

Read More »

141

click to vote

CC
2007
Springer

85views System Software» more CC 2007»

The Resolution Complexity of Independent Sets and Vertex Covers in Random Graphs

15 years 6 months ago

Download www.cs.washington.edu

Paul Beame, Russell Impagliazzo, Ashish Sabharwal

claim paper

Read More »

152

click to vote

JDA
2008

89views more JDA 2008»

Counting the number of independent sets in chordal graphs

15 years 6 months ago

Sciweavers

Explore & Download

Productivity Tools

Sciweavers