A Spectral Algorithm for Seriation and the Consecutive Ones Problem

Jonathan E. Atkins, Erik G. Boman, Bruce Hendrickson, 1998. SIAM Journal on Computing.

Presents a spectral algorithm for seriation, the problem of ordering items so that strongly related pairs sit close together, and shows that it solves the problem exactly rather than heuristically when a consistent order exists.

Voynich ManuscriptArticledoi: 10.1137/s0097539795285771Checked against the original0

What it's used for here

The inductive-methods survey cites it for spectral seriation of pages and bifolia.

Cited by on this site 1 record

1 methods surveys

Inductive methods

SRC

Cite it

Atkins, J. E., Boman, E. G., & Hendrickson, B. (1998). A Spectral Algorithm for Seriation and the Consecutive Ones Problem. SIAM Journal on Computing. https://doi.org/10.1137/s0097539795285771

@article{atkins1998spectral,
  author = {Atkins, Jonathan E. and Boman, Erik G. and Hendrickson, Bruce},
  title = {A Spectral Algorithm for Seriation and the Consecutive Ones Problem},
  journal = {SIAM Journal on Computing},
  year = {1998},
  doi = {10.1137/s0097539795285771},
  url = {https://doi.org/10.1137/s0097539795285771}
}

TY  - JOUR
TI  - A Spectral Algorithm for Seriation and the Consecutive Ones Problem
AU  - Atkins, Jonathan E.
AU  - Boman, Erik G.
AU  - Hendrickson, Bruce
PY  - 1998
JO  - SIAM Journal on Computing
DO  - 10.1137/s0097539795285771
UR  - https://doi.org/10.1137/s0097539795285771
ER  -

Atkins, Jonathan E. et al.. “A Spectral Algorithm for Seriation and the Consecutive Ones Problem.” SIAM Journal on Computing (1998). https://doi.org/10.1137/s0097539795285771.