Clustering analysis of a dissimilarity: a review of algebraic and geometric representation
From MaRDI portal
Publication:779022
DOI10.1007/S00357-019-09315-7OpenAlexW2934921305WikidataQ128125615 ScholiaQ128125615MaRDI QIDQ779022FDOQ779022
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
Cites Work
- Blossom V: A new implementation of a minimum cost perfect matching algorithm
- Planar graphs and poset dimension
- The unassigned distance geometry problem
- Well-Solvable Special Cases of the Traveling Salesman Problem: A Survey
- Towards auction algorithms for large dense assignment problems
- Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing
- A short proof of the tree-packing theorem
- Title not available (Why is that?)
- Schnyder woods and orthogonal surfaces
- Bounds of the number of disjoint spanning trees
- Note on the spanning-tree packing number of lexicographic product graphs
- Schnyder woods for higher genus triangulated surfaces, with applications to encoding
- Algorithms for the shortest and closest lattice vector problems
- Crossing families
- Separability generalizes Dirac's theorem
- Moplex orderings generated by the LexDFs algorithm
- Four point conditions and exponential neighborhoods for symmetric TSP
- Greedy optimal homotopy and homology generators
- Matchings, cycle bases, and the maximum genus of a graph
- Finding All the Elementary Circuits of a Directed Graph
- Toroidal maps: Schnyder woods, orthogonal surfaces and straight-line representations
- A forward/reverse auction algorithm for asymmetric assignment problems
- Computing Hermite and Smith normal forms of triangular integer matrices
- Homology flows, cohomology cuts
- Upper-embeddable graphs and related topics
- A trust branching path heuristic for zero-one programming
- Fundamental cycles and graph embeddings
- Robinsonian matrices: recognition challenges
- A note on packing spanning trees in graphs and bases in matroids
- The Bundled Crossing Number
- Finding shortest non-trivial cycles in directed graphs on surfaces
- New exponential neighbourhood for polynomially solvable TSPs
- The genus crossing number
- The Mondshein Sequence
- Plane 3-trees: embeddability and approximation
Cited In (1)
Uses Software
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)
