An algorithm for the maximum internally stable set in a weighted graph (Q3968462): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1080/00207168308803357 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2048347878 / rank | |||
Normal rank | |||
Revision as of 22:43, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An algorithm for the maximum internally stable set in a weighted graph |
scientific article |
Statements
An algorithm for the maximum internally stable set in a weighted graph (English)
0 references
1983
0 references
weighted undirected graph
0 references
NP-hard
0 references
recursive backtracking algorithm
0 references
