Linear-time algorithms for counting independent sets in bipartite permutation graphs (Q1675914)
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 independent sets in bipartite permutation graphs |
scientific article; zbMATH DE number 6802738
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Linear-time algorithms for counting independent sets in bipartite permutation graphs |
scientific article; zbMATH DE number 6802738 |
Statements
Linear-time algorithms for counting independent sets in bipartite permutation graphs (English)
0 references
3 November 2017
0 references
bipartite permutation graphs
0 references
independent sets
0 references
maximal independent sets
0 references
independent perfect dominating sets
0 references
algorithms
0 references
0 references
