Algorithm of acyclic dominating set problem on bipartite permutation graphs (Q5469725)
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: Algorithm of acyclic dominating set problem on bipartite permutation graphs |
scientific article; zbMATH DE number 5027037
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithm of acyclic dominating set problem on bipartite permutation graphs |
scientific article; zbMATH DE number 5027037 |
Statements
26 May 2006
0 references
acyclic domination number
0 references
0.9548633694648744
0 references
0.8076403141021729
0 references
0.8053534626960754
0 references
0.8004929423332214
0 references
