Clustering analysis of a dissimilarity: a review of algebraic and geometric representation
type: Item
instance of: scholarly article
title: Clustering analysis of a dissimilarity: a review of algebraic and geometric representation
author: D. Kharzeev
published in: Journal of Classification
publication date: 2020-07-21T00:00:00Z
Mathematics Subject Classification ID: 62H30
zbMATH DE Number: 7223595
zbMATH Keywords: clustering
zbMATH Keywords: dissimilarity measure
zbMATH Keywords: matching
zbMATH Keywords: ear decomposition
zbMATH Keywords: LexBFS
zbMATH Keywords: LexDFS
zbMATH Keywords: Schnyder woods
describes a project that uses: Blossom V
MaRDI profile type: Publication
full work available at URL: s00357-019-09315-7
OpenAlex ID: W2934921305
cites work: The Bundled Crossing Number
cites work: Crossing families
cites work: A note on packing spanning trees in graphs and bases in matroids
cites work: Separability generalizes Dirac's theorem
cites work: A forward/reverse auction algorithm for asymmetric assignment problems
cites work: Well-Solvable Special Cases of the Traveling Salesman Problem: A Survey
cites work: Towards auction algorithms for large dense assignment problems
cites work: Finding shortest non-trivial cycles in directed graphs on surfaces
cites work: Schnyder woods for higher genus triangulated surfaces, with applications to encoding
cites work: Homology flows, cohomology cuts
cites work: New exponential neighbourhood for polynomially solvable TSPs
cites work: Four point conditions and exponential neighborhoods for symmetric TSP
cites work: Plane 3-Trees: Embeddability and Approximation
cites work: The unassigned distance geometry problem
cites work: Greedy optimal homotopy and homology generators
cites work: Schnyder woods and orthogonal surfaces
cites work: Robinsonian matrices: recognition challenges
cites work: A trust branching path heuristic for zero-one programming
cites work: Toroidal maps: Schnyder woods, orthogonal surfaces and straight-line representations
cites work: Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing
cites work: Algorithms for the Shortest and Closest Lattice Vector Problems
cites work: Finding All the Elementary Circuits of a Directed Graph
cites work: A short proof of the tree-packing theorem
cites work: Blossom V: A new implementation of a minimum cost perfect matching algorithm
cites work: Matchings, cycle bases, and the maximum genus of a graph
cites work: Bounds of the number of disjoint spanning trees
cites work: Note on the spanning-tree packing number of lexicographic product graphs
cites work: The genus crossing number
cites work: Q5668937
cites work: Fundamental cycles and graph embeddings
cites work: The Mondshein Sequence
cites work: Planar graphs and poset dimension
cites work: Computing Hermite and Smith normal forms of triangular integer matrices
cites work: Moplex orderings generated by the LexDFs algorithm
cites work: Upper-embeddable graphs and related topics
Wikidata QID: Q128125615
DOI: 10.1007/S00357-019-09315-7
description: scientific article; zbMATH DE number 7223595