Fast and simple algorithms to count the number of vertex covers in an interval graph (Q845989)
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: Fast and simple algorithms to count the number of vertex covers in an interval graph |
scientific article; zbMATH DE number 5664795
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Fast and simple algorithms to count the number of vertex covers in an interval graph |
scientific article; zbMATH DE number 5664795 |
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
