Counting independent sets in graphs with bounded bipartite pathwidth (Q6074656)
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 independent sets in graphs with bounded bipartite pathwidth |
scientific article; zbMATH DE number 7749486
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Counting independent sets in graphs with bounded bipartite pathwidth |
scientific article; zbMATH DE number 7749486 |
Statements
Counting independent sets in graphs with bounded bipartite pathwidth (English)
0 references
12 October 2023
0 references
approximate counting
0 references
independent sets
0 references
pathwidth
0 references
0 references
0 references
0 references
0 references
0 references
0 references
