An algorithm for finding a maximum weighted independent set in an arbitrary graph (Q3210915)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An algorithm for finding a maximum weighted independent set in an arbitrary graph |
scientific article |
Statements
An algorithm for finding a maximum weighted independent set in an arbitrary graph (English)
0 references
1991
0 references
nongreedy approach
0 references
optimization
0 references
maximum weighted independent set
0 references
branch and bound
0 references
depth first search
0 references
heuristics
0 references
0 references
0 references
0 references
