Computation of Grundy dominating sequences in (co-)bipartite graphs (Q6184795)
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: Computation of Grundy dominating sequences in (co-)bipartite graphs |
scientific article; zbMATH DE number 7784410
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computation of Grundy dominating sequences in (co-)bipartite graphs |
scientific article; zbMATH DE number 7784410 |
Statements
Computation of Grundy dominating sequences in (co-)bipartite graphs (English)
0 references
5 January 2024
0 references
dominating sequence
0 references
bipartite graph
0 references
chain graphs
0 references
computational complexity
0 references
linear-time algorithm
0 references
0 references
0 references
0.8609229326248169
0 references
0.8117079734802246
0 references
0.8061754703521729
0 references
