On listing, sampling, and counting the chordal graphs with edge constraints (Q974754)
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: On listing, sampling, and counting the chordal graphs with edge constraints |
scientific article; zbMATH DE number 5717741
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On listing, sampling, and counting the chordal graphs with edge constraints |
scientific article; zbMATH DE number 5717741 |
Statements
On listing, sampling, and counting the chordal graphs with edge constraints (English)
0 references
7 June 2010
0 references
graph sandwich
0 references
chordal completion/deletion
0 references
enumeration
0 references
\#P-completeness
0 references
Markov chain Monte Carlo
0 references
0 references
0.9994770884513856
0 references
0.7616937756538391
0 references
0.7483142614364624
0 references
0.7427913546562195
0 references
0.7402411699295044
0 references
