The complexity of computing metric distances between partitions (Q1170849): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0165-4896(81)90042-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2017930713 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computational power of pushdown automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multidimensional scaling of measures of distance between partitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Metrics on spaces of finite trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Comparison And Evaluation Of Graph Theoretical Clustering Technioues / rank
 
Normal rank
Property / cites work
 
Property / cites work: Validity of clusters formed by graph-theoretic cluster methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5516565 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4085109 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5519710 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5519711 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3048571 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory of equivalence relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A metric and an ordering on sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4773020 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On clustering with chernoff-type faces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating Symmetric Relations by Equivalence Relations / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 17:15, 13 June 2024

scientific article
Language Label Description Also known as
English
The complexity of computing metric distances between partitions
scientific article

    Statements

    The complexity of computing metric distances between partitions (English)
    0 references
    0 references
    1981
    0 references
    0 references
    0 references
    0 references
    0 references
    complexity of computing metric distances
    0 references
    similarity of partitions
    0 references
    graph-theoretic representations
    0 references
    clustering
    0 references
    lattice
    0 references
    algorithm
    0 references
    0 references