An Exact Algorithm for TSP in Degree-3 Graphs via Circuit Procedure and Amortization on Connectivity Structure (Q4922118): Difference between revisions
From MaRDI portal
Item:Q4922118
Created a new Item |
Created claim: Wikidata QID (P12): Q56032471, #quickstatements; #temporary_batch_1705020570124 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q56032471 / rank | |||
Normal rank | |||
Revision as of 03:10, 12 January 2024
scientific article; zbMATH DE number 6167742
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An Exact Algorithm for TSP in Degree-3 Graphs via Circuit Procedure and Amortization on Connectivity Structure |
scientific article; zbMATH DE number 6167742 |
Statements
An Exact Algorithm for TSP in Degree-3 Graphs via Circuit Procedure and Amortization on Connectivity Structure (English)
0 references
28 May 2013
0 references
traveling salesman problem
0 references
exact exponential algorithms
0 references
cubic graphs
0 references
connectivity
0 references
measure and conquer
0 references
