Clustering analysis of a dissimilarity: a review of algebraic and geometric representation
From MaRDI portal
Publication:779022
DOI10.1007/s00357-019-09315-7OpenAlexW2934921305WikidataQ128125615 ScholiaQ128125615MaRDI QIDQ779022
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
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- The unassigned distance geometry problem
- A short proof of the tree-packing theorem
- Matchings, cycle bases, and the maximum genus of a graph
- Blossom V: A new implementation of a minimum cost perfect matching algorithm
- Schnyder woods for higher genus triangulated surfaces, with applications to encoding
- Towards auction algorithms for large dense assignment problems
- Schnyder woods and orthogonal surfaces
- A trust branching path heuristic for zero-one programming
- Fundamental cycles and graph embeddings
- Planar graphs and poset dimension
- Upper-embeddable graphs and related topics
- Crossing families
- Separability generalizes Dirac's theorem
- Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing
- A forward/reverse auction algorithm for asymmetric assignment problems
- Computing Hermite and Smith normal forms of triangular integer matrices
- Bounds of the number of disjoint spanning trees
- Robinsonian matrices: recognition challenges
- Toroidal maps: Schnyder woods, orthogonal surfaces and straight-line representations
- Moplex orderings generated by the LexDFs algorithm
- Note on the spanning-tree packing number of lexicographic product graphs
- 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
- Algorithms for the Shortest and Closest Lattice Vector Problems
- New exponential neighbourhood for polynomially solvable TSPs
- The genus crossing number
- Four point conditions and exponential neighborhoods for symmetric TSP
- Well-Solvable Special Cases of the Traveling Salesman Problem: A Survey
- The Mondshein Sequence
- Homology flows, cohomology cuts
- Finding All the Elementary Circuits of a Directed Graph
- Plane 3-Trees: Embeddability and Approximation
This page was built for publication: Clustering analysis of a dissimilarity: a review of algebraic and geometric representation
