Clustering analysis of a dissimilarity: a review of algebraic and geometric representation

DOI10.1007/S00357-019-09315-7MaRDI QIDQ779022zbMATH OpenOpenAlexWikidataFDO

Authors D. Kharzeev

Publication date 21 July 2020

Published in Journal of Classification (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00357-019-09315-7

zbMATH Keywords

clusteringmatchingdissimilarity measureear decompositionSchnyder woodsLexBFSLexDFS

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30)

Cites work

• scientific article; zbMATH DE number 3401090 (Why is no real title available?)
• A forward/reverse auction algorithm for asymmetric assignment problems
• A note on packing spanning trees in graphs and bases in matroids
• A short proof of the tree-packing theorem
• A trust branching path heuristic for zero-one programming
• Algorithms for the shortest and closest lattice vector problems
• Blossom V: A new implementation of a minimum cost perfect matching algorithm
• Bounds of the number of disjoint spanning trees
• Computing Hermite and Smith normal forms of triangular integer matrices
• Crossing families
• Finding All the Elementary Circuits of a Directed Graph
• Finding shortest non-trivial cycles in directed graphs on surfaces
• Four point conditions and exponential neighborhoods for symmetric TSP
• Fundamental cycles and graph embeddings
• Greedy optimal homotopy and homology generators
• Homology flows, cohomology cuts
• Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing
• Matchings, cycle bases, and the maximum genus of a graph
• Moplex orderings generated by the LexDFs algorithm
• New exponential neighbourhood for polynomially solvable TSPs
• Note on the spanning-tree packing number of lexicographic product graphs
• Planar graphs and poset dimension
• Plane 3-trees: embeddability and approximation
• Robinsonian matrices: recognition challenges
• Schnyder woods and orthogonal surfaces
• Schnyder woods for higher genus triangulated surfaces, with applications to encoding
• Separability generalizes Dirac's theorem
• The Bundled Crossing Number
• The Mondshein Sequence
• The genus crossing number
• The unassigned distance geometry problem
• Toroidal maps: Schnyder woods, orthogonal surfaces and straight-line representations
• Towards auction algorithms for large dense assignment problems
• Upper-embeddable graphs and related topics
• Well-Solvable Special Cases of the Traveling Salesman Problem: A Survey

Cited in

(1)

• Analysis of the cluster structure of collections of mathematical papers with different UDC codes

Describes a project that uses

Uses Software

• Blossom V

This page was built for publication: Clustering analysis of a dissimilarity: a review of algebraic and geometric representation

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