A linear time algorithm to solve the weighted perfect domination problem in series-parallel graphs (Q1328622): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 13:46, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A linear time algorithm to solve the weighted perfect domination problem in series-parallel graphs |
scientific article |
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
