On listing, sampling, and counting the chordal graphs with edge constraints (Q974754): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.tcs.2010.03.024 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2066133611 / rank | |||
Normal rank | |||
Revision as of 02:43, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On listing, sampling, and counting the chordal graphs with edge constraints |
scientific article |
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
