A linear time algorithm to solve the weighted perfect domination problem in series-parallel graphs (Q1328622)
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: A linear time algorithm to solve the weighted perfect domination problem in series-parallel graphs |
scientific article; zbMATH DE number 611348
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A linear time algorithm to solve the weighted perfect domination problem in series-parallel graphs |
scientific article; zbMATH DE number 611348 |
Statements
A linear time algorithm to solve the weighted perfect domination problem in series-parallel graphs (English)
0 references
1994
0 references
parsing tree
0 references
weighted perfect domination problem
0 references
series-parallel graphs
0 references
NP-complete
0 references
linear time algorithm
0 references
0.90739905834198
0 references
0.8575800061225891
0 references
0.8461310267448425
0 references
0.8328232765197754
0 references
0.8328232765197754
0 references
