Fast and simple algorithms to count the number of vertex covers in an interval graph (Q845989): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 14:31, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Fast and simple algorithms to count the number of vertex covers in an interval graph |
scientific article |
Statements
Fast and simple algorithms to count the number of vertex covers in an interval graph (English)
0 references
29 January 2010
0 references
algorithms
0 references
interval graph
0 references
vertex cover
0 references
independent set
0 references
counting
0 references
