A Lex-BFS-based recognition algorithm for Robinsonian matrices

DOI10.1016/J.DAM.2017.01.027MaRDI QIDQ6827807zbMATH OpenFDO

Authors Monique Laurent, Matteo Seminaroti

Publication date 25 September 2018

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.DAM.2017.01.027

zbMATH Keywords

Lex-BFSpartition refinementRobinson (dis)similarityseriationstraight enumerationunit interval graph

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Hypergraphs (05C65) Graph algorithms (graph-theoretic aspects) (05C85)

Cited in

(1)

• Extending Robinson spaces: complexity and algorithmic solutions for non-symmetric dissimilarity spaces

This page was built for publication: A Lex-BFS-based recognition algorithm for Robinsonian matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6827807)