Simple linear-time algorithms for counting independent sets in distance-hereditary graphs (Q1706124)
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: Simple linear-time algorithms for counting independent sets in distance-hereditary graphs |
scientific article; zbMATH DE number 6851665
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Simple linear-time algorithms for counting independent sets in distance-hereditary graphs |
scientific article; zbMATH DE number 6851665 |
Statements
Simple linear-time algorithms for counting independent sets in distance-hereditary graphs (English)
0 references
21 March 2018
0 references
distance-hereditary graphs
0 references
counting problem
0 references
independent sets
0 references
independent dominating sets
0 references
independent perfect dominating sets
0 references
linear-time algorithms
0 references
0 references
0 references
0 references
0 references
