Acyclic domination on bipartite permutation graphs (Q845701)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5664473
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Acyclic domination on bipartite permutation graphs |
scientific article; zbMATH DE number 5664473 |
Statements
Acyclic domination on bipartite permutation graphs (English)
0 references
29 January 2010
0 references
algorithms
0 references
dominating set
0 references
acyclic dominating set
0 references
bipartite permutation graph
0 references
0 references
0.9548633694648744
0 references
0.8052168488502502
0 references
0.8020495772361755
0 references
0.8008780479431152
0 references
0.789966344833374
0 references
