Uniform embeddings for Robinson similarity matrices

DOI10.1007/978-3-030-83508-8_36OpenAlexW3198507813MaRDI QIDQ832894FDOQ832894

Authors: Zhiyuan Zhang, Jeannette Janssen Edit this on Wikidata

Publication date: 25 March 2022

Full work available at URL: https://arxiv.org/abs/2105.09197

zbMATH Keywords

proper interval graphunit interval graphindifference graphRobinson similarity

Mathematics Subject Classification ID

Data structures (68P05) Algorithms in computer science (68Wxx)

Cites Work

• A simple 3-sweep LBFS algorithm for the recognition of unit interval graphs
• Incidence matrices, interval graphs and seriation in archeology
• A Spectral Algorithm for Seriation and the Consecutive Ones Problem
• Title not available (Why is that?)
• Simple linear time recognition of unit interval graphs
• Uniform linear embeddings of graphons
• A short proof that `proper = unit'
• The Roberts characterization of proper and unit interval graphs
• Seriation and matrix reordering methods: An historical overview
• Similarity-first search: a new algorithm with application to Robinsonian matrix recognition

Cited In (1)

• Uniform Embeddings for Robinson Similarity Matrices

Uses Software

• Algorithm 97

This page was built for publication: Uniform embeddings for Robinson similarity matrices

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