Linear time algorithms for counting the number of minimal vertex covers with minimum/maximum size in an interval graph (Q963461)
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: Linear time algorithms for counting the number of minimal vertex covers with minimum/maximum size in an interval graph |
scientific article; zbMATH DE number 5694991
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Linear time algorithms for counting the number of minimal vertex covers with minimum/maximum size in an interval graph |
scientific article; zbMATH DE number 5694991 |
Statements
Linear time algorithms for counting the number of minimal vertex covers with minimum/maximum size in an interval graph (English)
0 references
19 April 2010
0 references
algorithms
0 references
combinatorial problems
0 references
counting problems
0 references
interval graphs
0 references
minimum vertex covers
0 references
maximum minimal vertex covers
0 references
0 references
