Pages that link to "Item:Q269174"

The following pages link to An optimal algorithm to recognize Robinsonian dissimilarities (Q269174):

Displaying 14 items.

• Splitting metrics by \(T_0\)-quasi-metrics (Q492235) (← links)
• A structural characterization for certifying Robinsonian matrices (Q529005) (← links)
• \texttt{PQser:} a Matlab package for spectral seriation (Q670489) (← links)
• Testing a mixture model of single-peaked preferences (Q1642168) (← links)
• Expansion of gene clusters, circular orders, and the shortest Hamiltonian path problem (Q1659722) (← links)
• Splitting ultra-metrics by \(T_{0}\)-ultra-quasi-metrics (Q1744597) (← links)
• The quadratic assignment problem is easy for Robinsonian matrices with Toeplitz structure (Q1785334) (← links)
• A Lex-BFS-based recognition algorithm for Robinsonian matrices (Q1786881) (← links)
• The weighted sitting closer to friends than enemies problem in the line (Q2099388) (← links)
• Cut norm discontinuity of triangular truncation of graphons (Q2154285) (← links)
• Robinsonian matrices: recognition challenges (Q2403299) (← links)
• The seriation problem in the presence of a double Fiedler value (Q2679667) (← links)
• Graph sequences sampled from Robinson graphons (Q6146495) (← links)
• Modules in Robinson Spaces (Q6187080) (← links)