The seriation problem in the presence of a double Fiedler value
Concas A.;Fenu C.
;Rodriguez G.;
2023-01-01
Abstract
Seriation is a problem consisting of seeking the best enumeration order of a set of units whose interrelationship is described by a bipartite graph. An algorithm for spectral seriation based on the use of the Fiedler vector of the Laplacian matrix associated to the problem was developed by Atkins et al. under the assumption that the Fiedler value is simple. In this paper, we analyze the case in which the Fiedler value of the Laplacian is not simple, discuss its effect on the set of the admissible solutions, and study possible approaches to actually perform the computation. Examples and numerical experiments illustrate the effectiveness of the proposed methods.File | Size | Format | |
---|---|---|---|
last_version.pdf open access
Type: versione pre-print
Size 433.58 kB
Format Adobe PDF
|
433.58 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.