An optimal algorithm to recognize Robinsonian dissimilarities (Q269174): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: NP-hard approximation problems in overlapping clustering. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4004055 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4717930 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3880292 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-bound algorithm for fitting anti-Robinson structures to symmetric dissimilarity matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5386564 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognition of Robinsonian dissimilarities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Seriation in the presence of errors: NP-hardness of \(l_{\infty}\)-fitting Robinson structures to dissimilarity matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Seriation in the presence of errors: a factor 16 approximation algorithm for \(l_{\infty }\)-fitting Robinson structures to distances / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4849934 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3360715 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incidence matrices and interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Characterization of Comparability Graphs and of Interval Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3328583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of a modification of Gusfield's recursive algorithm for reconstructing ultrametric trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: SOME APPLICATIONS OF GRAPH THEORY AND RELATED NON‐METRIC TECHNIQUES TO PROBLEMS OF APPROXIMATE SERIATION: THE CASE OF SYMMETRIC PROXIMITY MEASURES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incidence matrices, interval graphs and seriation in archeology / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3313666 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three Partition Refinement Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Doubly lexical ordering of dense 0--1 matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relationship-Based Clustering and Visualization for High-Dimensional Data Mining / rank
 
Normal rank

Latest revision as of 19:12, 11 July 2024

scientific article
Language Label Description Also known as
English
An optimal algorithm to recognize Robinsonian dissimilarities
scientific article

    Statements

    An optimal algorithm to recognize Robinsonian dissimilarities (English)
    0 references
    0 references
    0 references
    18 April 2016
    0 references
    Robinsonian dissimilarities
    0 references
    classification
    0 references
    seriation
    0 references
    interval graphs
    0 references
    PQ-trees
    0 references
    consecutive one's property
    0 references
    partition refinement
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references