A linear time algorithm to solve the weighted perfect domination problem in series-parallel graphs (Q1328622): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
m rollbackEdits.php mass rollback Tag: Rollback |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0377-2217(94)90163-5 / rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2059231566 / rank | |||
Revision as of 13:20, 20 March 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
