{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,20]],"date-time":"2026-03-20T01:21:59Z","timestamp":1773969719888,"version":"3.50.1"},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,12,10]],"date-time":"2022-12-10T00:00:00Z","timestamp":1670630400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,12,10]],"date-time":"2022-12-10T00:00:00Z","timestamp":1670630400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100009873","name":"Regione Autonoma della Sardegna","doi-asserted-by":"publisher","award":["RASSR57257 \u201dAlgorithms and Models for Imaging Science [AMIS]\u201d"],"award-info":[{"award-number":["RASSR57257 \u201dAlgorithms and Models for Imaging Science [AMIS]\u201d"]}],"id":[{"id":"10.13039\/501100009873","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100009873","name":"Regione Autonoma della Sardegna","doi-asserted-by":"publisher","award":["RASSR57257 \u201dAlgorithms and Models for Imaging Science [AMIS]\u201d"],"award-info":[{"award-number":["RASSR57257 \u201dAlgorithms and Models for Imaging Science [AMIS]\u201d"]}],"id":[{"id":"10.13039\/501100009873","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100009873","name":"Regione Autonoma della Sardegna","doi-asserted-by":"publisher","award":["RASSR57257 \u201dAlgorithms and Models for Imaging Science [AMIS]\u201d"],"award-info":[{"award-number":["RASSR57257 \u201dAlgorithms and Models for Imaging Science [AMIS]\u201d"]}],"id":[{"id":"10.13039\/501100009873","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100017142","name":"Gruppo Nazionale per il Calcolo Scientifico","doi-asserted-by":"publisher","award":["Progetto ricerca 2020 \u201dTecniche numeriche per l\u2019analisi delle reti complesse e lo studio dei problemi inversi\u201d"],"award-info":[{"award-number":["Progetto ricerca 2020 \u201dTecniche numeriche per l\u2019analisi delle reti complesse e lo studio dei problemi inversi\u201d"]}],"id":[{"id":"10.13039\/100017142","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100017142","name":"Gruppo Nazionale per il Calcolo Scientifico","doi-asserted-by":"publisher","award":["Progetto ricerca 2020 \u201dTecniche numeriche per l\u2019analisi delle reti complesse e lo studio dei problemi inversi\u201d"],"award-info":[{"award-number":["Progetto ricerca 2020 \u201dTecniche numeriche per l\u2019analisi delle reti complesse e lo studio dei problemi inversi\u201d"]}],"id":[{"id":"10.13039\/100017142","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100017142","name":"Gruppo Nazionale per il Calcolo Scientifico","doi-asserted-by":"publisher","award":["Progetto ricerca 2020 \u201dTecniche numeriche per l\u2019analisi delle reti complesse e lo studio dei problemi inversi\u201d"],"award-info":[{"award-number":["Progetto ricerca 2020 \u201dTecniche numeriche per l\u2019analisi delle reti complesse e lo studio dei problemi inversi\u201d"]}],"id":[{"id":"10.13039\/100017142","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100009873","name":"Regione Autonoma della Sardegna","doi-asserted-by":"publisher","award":["European Social Fund 2014-2020 - Axis III Education and Formation"],"award-info":[{"award-number":["European Social Fund 2014-2020 - Axis III Education and Formation"]}],"id":[{"id":"10.13039\/501100009873","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100009873","name":"Regione Autonoma della Sardegna","doi-asserted-by":"publisher","award":["Objective 10.5"],"award-info":[{"award-number":["Objective 10.5"]}],"id":[{"id":"10.13039\/501100009873","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100009873","name":"Regione Autonoma della Sardegna","doi-asserted-by":"publisher","award":["Line of Activity 10.5.12"],"award-info":[{"award-number":["Line of Activity 10.5.12"]}],"id":[{"id":"10.13039\/501100009873","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Research Council KU Leuven","award":["C16\/21\/002"],"award-info":[{"award-number":["C16\/21\/002"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Numer Algor"],"published-print":{"date-parts":[[2023,1]]},"DOI":"10.1007\/s11075-022-01461-1","type":"journal-article","created":{"date-parts":[[2022,12,10]],"date-time":"2022-12-10T12:02:37Z","timestamp":1670673757000},"page":"407-435","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["The seriation problem in the presence of a double Fiedler value"],"prefix":"10.1007","volume":"92","author":[{"given":"Anna","family":"Concas","sequence":"first","affiliation":[],"role":[{"role":"author","vocab":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2831-0591","authenticated-orcid":false,"given":"Caterina","family":"Fenu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocab":"crossref"}]},{"given":"Giuseppe","family":"Rodriguez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocab":"crossref"}]},{"given":"Raf","family":"Vandebril","sequence":"additional","affiliation":[],"role":[{"role":"author","vocab":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,12,10]]},"reference":[{"issue":"4","key":"1461_CR1","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/BF02294859","volume":"63","author":"L Hubert","year":"1998","unstructured":"Hubert, L., Arabie, P., Meulman, J.: Graph-theoretic representations for proximity matrices through strongly-anti-Robinson or circular strongly-anti-Robinson matrices. Psychometrika 63(4), 341\u2013358 (1998)","journal-title":"Psychometrika"},{"issue":"4","key":"1461_CR2","doi-asserted-by":"publisher","first-page":"1223","DOI":"10.1137\/21M139356X","volume":"3","author":"S Armstrong","year":"2021","unstructured":"Armstrong, S., Guzm\u00e1n, C., Sing Long, C.A.: An optimal algorithm for strict circular seriation. SIAM J. Math. Data Sci. 3(4), 1223\u20131250 (2021)","journal-title":"SIAM J. Math. Data Sci."},{"key":"1461_CR3","unstructured":"Recanati, A., Kerdreux, T., d\u2019Aspremont, A.: Reconstructing latent orderings by spectral clustering. arXiv:1807.07122 (2018)"},{"issue":"10","key":"1461_CR4","doi-asserted-by":"publisher","first-page":"1891","DOI":"10.1109\/TIP.2008.2002305","volume":"17","author":"RR Coifman","year":"2008","unstructured":"Coifman, R.R., Shkolnisky, Y., Sigworth, F.J., Singer, A.: Graph Laplacian tomography from unknown random projections. IEEE Trans. Image Process. 17(10), 1891\u20131899 (2008)","journal-title":"IEEE Trans. Image Process."},{"key":"1461_CR5","doi-asserted-by":"publisher","first-page":"107192","DOI":"10.1016\/j.patcog.2019.107192","volume":"103","author":"X Evangelopoulos","year":"2020","unstructured":"Evangelopoulos, X., Brockmeier, A.J., Mu, T., Goulermas, J.Y.: Circular object arrangement using spherical embeddings. Pattern Recognit. 103, 107192 (2020)","journal-title":"Pattern Recognit."},{"key":"1461_CR6","doi-asserted-by":"crossref","unstructured":"Carmona, M., Chepoi, V., Naves, G., Pr\u00e9a, P.: A simple and optimal algorithm for strict circular seriation. arXiv:2205.04694 (2022)","DOI":"10.1137\/22M1495342"},{"key":"1461_CR7","first-page":"295","volume":"29","author":"WMF Petrie","year":"1899","unstructured":"Petrie, W.M.F.: Sequences in prehistoric remains. J. R. Anthropol. Inst. 29, 295\u2013301 (1899)","journal-title":"J. R. Anthropol. Inst."},{"issue":"3","key":"1461_CR8","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1037\/1082-989X.11.3.271","volume":"11","author":"MJ Brusco","year":"2006","unstructured":"Brusco, M.J., Steinley, D.: Clustering, seriation, and subset extraction of confusion data. Psychol. Methods 11(3), 271\u2013286 (2006)","journal-title":"Psychol. Methods"},{"key":"1461_CR9","doi-asserted-by":"publisher","first-page":"14863","DOI":"10.1073\/pnas.95.25.14863","volume":"95","author":"MB Eisen","year":"1998","unstructured":"Eisen, M.B., Spellman, P.T., Brown, P.O., Botstein, D.: Cluster analysis and display of genome-wide expression patterns. P. Natl. Acad. Sci. U.S.A. 95, 14863\u201314868 (1998)","journal-title":"P. Natl. Acad. Sci. U.S.A."},{"key":"1461_CR10","volume-title":"Mathematics in the Archaeological and Historical Sciences","author":"FR Hodson","year":"1971","unstructured":"Hodson, F.R., Kendall, D.G., Tautu, P: Mathematics in the Archaeological and Historical Sciences. University Press, Edinburgh (1971)"},{"key":"1461_CR11","doi-asserted-by":"crossref","unstructured":"Mirkin, B.G., Rodin, S.N.: Graphs and Genes. Biomathematics, vol. 11. Springer (1984)","DOI":"10.1007\/978-3-642-69280-2"},{"issue":"3","key":"1461_CR12","doi-asserted-by":"publisher","first-page":"879","DOI":"10.1007\/s11075-018-0510-6","volume":"80","author":"A Concas","year":"2019","unstructured":"Concas, A., Fenu, C., Rodriguez, G.: PQser: a Matlab package for spectral seriation. Numer. Algorithms 80(3), 879\u2013902 (2019)","journal-title":"Numer. Algorithms"},{"issue":"4","key":"1461_CR13","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1002\/nla.1680020402","volume":"2","author":"ST Barnard","year":"1995","unstructured":"Barnard, S.T., Pothen, A., Simon, H.: A spectral algorithm for envelope reduction of sparse matrices. Numer. Linear Algebra Appl. 2(4), 317\u2013334 (1995)","journal-title":"Numer. Linear Algebra Appl."},{"key":"1461_CR14","unstructured":"Fogel, F., Jenatton, R., Bach, F., d\u2019Aspremont, A.: Convex relaxations for permutation problems. In: Burges, C.J., Bottou, L., Welling, M., Ghahramani, Z., Weinberger, K.Q. (eds.) Advances in neural information processing systems vol. 26 (NIPS 2013) (2013)"},{"key":"1461_CR15","unstructured":"Recanati, A., Servant, N., Vert, J.-P., d\u2019Aspremont, A.: Robust seriation and applications to cancer genomics. arXiv:1806.00664 (2018)"},{"issue":"4","key":"1461_CR16","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1007\/s10994-018-5764-7","volume":"108","author":"X Evangelopoulos","year":"2019","unstructured":"Evangelopoulos, X., Brockmeier, A.J., Mu, T., Goulermas, J.Y.: Continuation methods for approximate large scale object sequencing. Mach. Learn. 108(4), 595\u2013626 (2019)","journal-title":"Mach. Learn."},{"key":"1461_CR17","unstructured":"Lim, C.H., Wright, S.: A box-constrained approach for hard permutation problems. In: International conference on machine learning, pp. 2454\u20132463. PMLR (2016)"},{"issue":"3","key":"1461_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.18637\/jss.v025.i03","volume":"25","author":"M Hahsler","year":"2008","unstructured":"Hahsler, M., Hornik, K., Buchta, C.: Getting things in order: an introduction to the R package seriation. J. Stat. Softw. 25(3), 1\u201334 (2008)","journal-title":"J. Stat. Softw."},{"key":"1461_CR19","first-page":"29","volume":"LV","author":"P Piana Agostinetti","year":"2005","unstructured":"Piana Agostinetti, P., Sommacal, M.: Il problema della seriazione in archeologia. Rivista di Scienze Preistoriche LV, 29\u201369 (2005)","journal-title":"Rivista di Scienze Preistoriche"},{"key":"1461_CR20","doi-asserted-by":"crossref","unstructured":"Pardalos, P.M., Rendl, F., Wolkowicz, H.: The quadratic assignment problem: a survey and recent developments. In: Pardalos, P.M., Wolkowicz, H. (eds.) Quadratic assignment and related problems. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 16, pp. 1\u201342. American Mathematical Society (1994)","DOI":"10.1090\/dimacs\/016\/01"},{"issue":"1","key":"1461_CR21","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1137\/S0097539795285771","volume":"28","author":"JE Atkins","year":"1998","unstructured":"Atkins, J.E., Boman, E.G., Hendrickson, B.: A spectral algorithm for seriation and the consecutive ones problem. SIAM J. Comput. 28(1), 297\u2013310 (1998)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"1461_CR22","doi-asserted-by":"publisher","first-page":"298","DOI":"10.21136\/CMJ.1973.101168","volume":"23","author":"M Fiedler","year":"1973","unstructured":"Fiedler, M.: Algebraic connectivity of graphs. Czech. Math. J. 23(2), 298\u2013305 (1973)","journal-title":"Czech. Math. J."},{"issue":"4","key":"1461_CR23","doi-asserted-by":"publisher","first-page":"619","DOI":"10.21136\/CMJ.1975.101357","volume":"25","author":"M Fiedler","year":"1975","unstructured":"Fiedler, M.: A property of eigenvectors of nonnegative symmetric matrices and its application to graph theory. Czech. Math. J. 25(4), 619\u2013633 (1975)","journal-title":"Czech. Math. J."},{"issue":"1","key":"1461_CR24","doi-asserted-by":"publisher","first-page":"57","DOI":"10.4064\/-25-1-57-70","volume":"25","author":"M Fiedler","year":"1989","unstructured":"Fiedler, M.: Laplacian of graphs and algebraic connectivity. Banach Center Publ. 25(1), 57\u201370 (1989)","journal-title":"Banach Center Publ."},{"issue":"1","key":"1461_CR25","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/j.laa.2006.08.017","volume":"423","author":"NMM De Abreu","year":"2007","unstructured":"De Abreu, N.M.M.: Old and new results on algebraic connectivity of graphs. Linear Algebra Appl. 423(1), 53\u201373 (2007)","journal-title":"Linear Algebra Appl."},{"key":"1461_CR26","doi-asserted-by":"crossref","unstructured":"Jamakovic, A, Mieghem, P.V: On the robustness of complex networks by using the algebraic connectivity. In: International conference on research in networking, pp. 183\u2013194. Springer (2008)","DOI":"10.1007\/978-3-540-79549-0_16"},{"key":"1461_CR27","doi-asserted-by":"crossref","unstructured":"Jamakovic, A, Uhlig, S: On the relationship between the algebraic connectivity and graph\u2019s robustness to node and link failures. In: 2007 Next generation internet networks, pp 96\u2013102. IEEE (2007)","DOI":"10.1109\/NGI.2007.371203"},{"issue":"2","key":"1461_CR28","first-page":"657","volume":"40","author":"DG Kendall","year":"1963","unstructured":"Kendall, D.G.: A statistical approach to Flinders\u2013Petries sequence-dating. Bull. Int. Stat. Inst. 40(2), 657\u2013681 (1963)","journal-title":"Bull. Int. Stat. Inst."},{"issue":"1193","key":"1461_CR29","first-page":"125","volume":"269","author":"DG Kendall","year":"1970","unstructured":"Kendall, D.G.: A mathematical approach to seriation. Philos. Trans. R. Soc. A-Math. Phys. Eng. Sci. 269(1193), 125\u2013134 (1970)","journal-title":"Philos. Trans. R. Soc. A-Math. Phys. Eng. Sci."},{"issue":"4","key":"1461_CR30","doi-asserted-by":"publisher","first-page":"301","DOI":"10.2307\/276979","volume":"16","author":"GW Brainerd","year":"1951","unstructured":"Brainerd, G.W.: The place of chronological ordering in archaeological analysis. Am. Antiq. 16(4), 301\u2013313 (1951)","journal-title":"Am. Antiq."},{"issue":"4","key":"1461_CR31","doi-asserted-by":"publisher","first-page":"293","DOI":"10.2307\/276978","volume":"16","author":"WS Robinson","year":"1951","unstructured":"Robinson, W.S.: A method for chronologically ordering archaeological deposits. Am. Antiq. 16(4), 293\u2013301 (1951)","journal-title":"Am. Antiq."},{"issue":"2","key":"1461_CR32","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/s003579900015","volume":"14","author":"V Chepoi","year":"1997","unstructured":"Chepoi, V., Fichet, B.: Recognition of Robinsonian dissimilarities. J. Classif. 14(2), 311\u2013325 (1997)","journal-title":"J. Classif."},{"key":"1461_CR33","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/j.dam.2017.01.027","volume":"222","author":"M Laurent","year":"2017","unstructured":"Laurent, M., Seminaroti, M.: A Lex-BFS-based recognition algorithm for Robinsonian matrices. Discret. Appl. Math. 222, 151\u2013165 (2017)","journal-title":"Discret. Appl. Math."},{"issue":"3","key":"1461_CR34","doi-asserted-by":"publisher","first-page":"1765","DOI":"10.1137\/16M1056791","volume":"31","author":"M Laurent","year":"2017","unstructured":"Laurent, M., Seminaroti, M.: Similarity-first search: a new algorithm with application to Robinsonian matrix recognition. SIAM Discret Math. 31 (3), 1765\u20131800 (2017)","journal-title":"SIAM Discret Math."},{"issue":"3","key":"1461_CR35","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s00357-014-9150-2","volume":"31","author":"P Pr\u00e9a","year":"2014","unstructured":"Pr\u00e9a, P., Fortin, D.: An optimal algorithm to recognize Robinsonian dissimilarities. J. Classif 31(3), 3\u201351 (2014)","journal-title":"J. Classif"},{"key":"1461_CR36","unstructured":"Seston, M.: Dissimilarit\u00e9s de Robinson: algorithmes de reconnaissance et d\u2019approximation. PhD thesis Aix Marseille vol. 2 (2008)"},{"issue":"3","key":"1461_CR37","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1016\/S0022-0000(76)80045-1","volume":"13","author":"KS Booth","year":"1976","unstructured":"Booth, K.S., Lueker, G.S.: Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms. J. Comput. Syst. Sci. 13(3), 335\u2013379 (1976)","journal-title":"J. Comput. Syst. Sci."},{"key":"1461_CR38","volume-title":"The Algebraic Eigenvalue Problem vol. 87","author":"JH Wilkinson","year":"1965","unstructured":"Wilkinson, J.H.: The Algebraic Eigenvalue Problem vol. 87. Clarendon Press, Oxford (1965)"},{"issue":"3","key":"1461_CR39","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1145\/321033.321039","volume":"7","author":"JM Ortega","year":"1960","unstructured":"Ortega, J.M.: On Sturm sequences for tridiagonal matrices. J. ACM 7(3), 260\u2013263 (1960)","journal-title":"J. ACM"},{"key":"1461_CR40","unstructured":"Davis, P.J: Circulant Matrices. Wiley (1979)"},{"issue":"5","key":"1461_CR41","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1090\/S0002-9904-1950-09407-5","volume":"56","author":"HSM Coxeter","year":"1950","unstructured":"Coxeter, H.S.M.: Self-dual configurations and regular graphs. Bull. Amer. Math. Soc. 56(5), 413\u2013455 (1950)","journal-title":"Bull. Amer. Math. Soc."},{"issue":"2","key":"1461_CR42","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1016\/S0021-9800(69)80116-X","volume":"6","author":"ME Watkins","year":"1969","unstructured":"Watkins, M.E.: A theorem on tait colorings with an application to the generalized Petersen graphs. J. Comb. Theory 6(2), 152\u2013164 (1969)","journal-title":"J. Comb. Theory"},{"issue":"1","key":"1461_CR43","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/s00707-010-0382-x","volume":"217","author":"A Kaveh","year":"2011","unstructured":"Kaveh, A., Rahami, H.: Block circulant matrices and applications in free vibration analysis of cyclically repetitive structures. Acta Mech. 217(1), 51\u201362 (2011)","journal-title":"Acta Mech."}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-022-01461-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11075-022-01461-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-022-01461-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,2]],"date-time":"2023-12-02T19:48:06Z","timestamp":1701546486000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11075-022-01461-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,12,10]]},"references-count":43,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,1]]}},"alternative-id":["1461"],"URL":"https:\/\/doi.org\/10.1007\/s11075-022-01461-1","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"value":"1017-1398","type":"print"},{"value":"1572-9265","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,12,10]]},"assertion":[{"value":"7 April 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 November 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 December 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The author Giuseppe Rodriguez is a member of the editorial board of <i>Numerical Algorithms<\/i>. The authors declare no other conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"<!--Emphasis Type='Bold' removed-->Conflict of interest"}}]}}