Counting the number of independent sets in chordal graphs (Q935840)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Counting the number of independent sets in chordal graphs |
scientific article; zbMATH DE number 5309336
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Counting the number of independent sets in chordal graphs |
scientific article; zbMATH DE number 5309336 |
Statements
Counting the number of independent sets in chordal graphs (English)
0 references
8 August 2008
0 references
chordal graph
0 references
counting
0 references
enumeration
0 references
independent set
0 references
NP-completeness
0 references
\#P-completeness
0 references
polynomial time algorithm
0 references
0 references
0 references
0.9814559817314148
0 references
0.8403307795524597
0 references
0.8188604712486267
0 references
0.8142126202583313
0 references
