Solving NP-Hard Problems on Graphs That Are Almost Trees and an Application to Facility Location Problems (Q3766845): Difference between revisions
From MaRDI portal
Set profile property. |
Created claim: Wikidata QID (P12): Q128126939, #quickstatements; #temporary_batch_1722371031483 |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1145/828.322439 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1987698099 / rank | |||
Normal rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q128126939 / rank | |||
Normal rank | |||
Latest revision as of 21:37, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Solving NP-Hard Problems on Graphs That Are Almost Trees and an Application to Facility Location Problems |
scientific article |
Statements
Solving NP-Hard Problems on Graphs That Are Almost Trees and an Application to Facility Location Problems (English)
0 references
1984
0 references
polynomial time algorithms
0 references
NP-complete problems
0 references
parallel algorithms
0 references
NP-hard graph problems
0 references
facility location problem
0 references
parallel implementation
0 references
