Matrix and Network Models in Archaeology (Q3315299)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3845373
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Matrix and Network Models in Archaeology |
scientific article; zbMATH DE number 3845373 |
Statements
1984
0 references
traveling salesman
0 references
Hamiltonian circuits
0 references
seriation of data
0 references
linear ordering
0 references
archaeolgical data
0 references
Matrix and Network Models in Archaeology (English)
0 references
0.8108764290809631
0 references
0.7739003300666809
0 references
0.7686792612075806
0 references
This is an expository article devoted to matrix- and graph-theoretic models for the seriation of data, i.e. linear ordering depending on given pairwise comparisons. In archaeological applications the linear dimension is usually time. The models discussed revolve around the traveling salesman problem and are based on works by Kendall, Wilkinson, and Laporte. Two examples from the archaeolgical data are examined in detail.
0 references