The traveling salesman problem in graphs with 3-edge cutsets (Q3773723): Difference between revisions
From MaRDI portal
Set profile property. |
Created claim: Wikidata QID (P12): Q128524564, #quickstatements; #temporary_batch_1724714016629 |
||
| (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/3149.3154 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1968919074 / rank | |||
Normal rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q128524564 / rank | |||
Normal rank | |||
Latest revision as of 00:16, 27 August 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The traveling salesman problem in graphs with 3-edge cutsets |
scientific article |
Statements
The traveling salesman problem in graphs with 3-edge cutsets (English)
0 references
1985
0 references
graph decompositions
0 references
integer polytopes
0 references
decomposition properties of a graph
0 references
polynomial solution
0 references
traveling salesman problem
0 references
3-edge cutset
0 references
polynomial algorithm
0 references
Halin graphs
0 references
prismatic graphs
0 references
