Counting independent sets in graphs with bounded bipartite pathwidth (Q6074656): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 06:57, 10 July 2024
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
