Solving NP-Hard Problems on Graphs That Are Almost Trees and an Application to Facility Location Problems (Q3766845)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Solving NP-Hard Problems on Graphs That Are Almost Trees and an Application to Facility Location Problems |
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
