An optimal time algorithm for finding a maximum weight independent set in a tree (Q1107326): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf01934098 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1970602728 / rank | |||
Normal rank | |||
Latest revision as of 10:18, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An optimal time algorithm for finding a maximum weight independent set in a tree |
scientific article |
Statements
An optimal time algorithm for finding a maximum weight independent set in a tree (English)
0 references
1988
0 references
The maximum weight independent set problem for a general graph is NP- hard. But for some special classes of graphs, polynomial time algorithms do exist for solving it. Based on the divide-and-conquer strategy, \textit{Sh. Pawagi} [ibid. 27, 170-180 (1987; Zbl 0642.68128)] has presented an O(\(| V| \log | V|)\) time algorithm for solving this problem on a tree. In this paper, we propose an O(\(| V|)\) time algorithm to improve Pawagi's result. The proposed algorithm is based on the dynamic programming strategy and is time optimal within a constant factor.
0 references
maximum weight independent set in trees
0 references
dynamic programming
0 references
time optimal
0 references
