Sciweavers

32 search results - page 1 / 7

» On Counting Independent Sets in Sparse Graphs

8

FOCS
1999
IEEE

70views Theoretical Computer Science» more FOCS 1999»

On Counting Independent Sets in Sparse Graphs

13 years 9 months ago

On Counting Independent Sets in Sparse Graphs

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

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

claim paper

Read More »

13

CC
2000
Springer

90views System Software» more CC 2000»

The complexity of counting colourings and independent sets in sparse graphs and hypergraphs

13 years 5 months ago

The complexity of counting colourings and independent sets in sparse graphs and hypergraphs

Download web.maths.unsw.edu.au

Catherine S. Greenhill

claim paper

Read More »

11

WG
2005
Springer

96views Theoretical Computer Science» more WG 2005»

Linear-Time Counting Algorithms for Independent Sets in Chordal Graphs

13 years 11 months ago

Linear-Time Counting Algorithms for Independent Sets in Chordal Graphs

Download www.jaist.ac.jp

Yoshio Okamoto, Takeaki Uno, Ryuhei Uehara

claim paper

Read More »

13

JDA
2008

89views more JDA 2008»

Counting the number of independent sets in chordal graphs

13 years 5 months ago

Counting the number of independent sets in chordal graphs

Download www.is.titech.ac.jp

Yoshio Okamoto, Takeaki Uno, Ryuhei Uehara

claim paper

Read More »

17

CANDC
2005
ACM

95views Emerging Technology» more CANDC 2005»

A family of metrics for biopolymers based on counting independent sets

13 years 5 months ago

A family of metrics for biopolymers based on counting independent sets

Download dmi.uib.es

We introduce a new family of metrics for graphs of fixed size, based on counting-independent sets. Our definition is simpler and easier to e than the edge ideal metric family defi...

Jairo Rocha, Mercè Llabrés, Ricardo ...

claim paper

Read More »

« Prev « First page 1 / 7 Last » Next »