Optimal hierarchical clustering on a graph
From MaRDI portal
Publication:6065857
DOI10.1002/net.22043zbMath1528.90268OpenAlexW3165034464MaRDI QIDQ6065857
Gökçe Kahvecioğlu, David P. Morton
Publication date: 11 December 2023
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.22043
Programming involving graphs or networks (90C35) Multi-objective and goal programming (90C29) Signed and weighted graphs (05C22)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Multiple criteria decision analysis. State of the art surveys. In 2 volumes
- Dynamic evolution of economically preferred facilities
- A faster strongly polynomial time algorithm for submodular function minimization
- The ellipsoid method and its consequences in combinatorial optimization
- A fast algorithm for the generalized parametric minimum cut problem and applications
- Separating from the dominant of the spanning tree polytope
- A faster parametric minimum-cut algorithm
- A faster algorithm for computing the strength of a network
- Cluster analysis and mathematical programming
- On the graphic matroid parity problem
- Graph partitioning models for parallel computing
- A new method for optimizing a linear function over the efficient set of a multiobjective integer program
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- An improved algorithm for solving biobjective integer programs
- A Criterion Space Search Algorithm for Biobjective Integer Programming: The Balanced Box Method
- Theory of Principal Partitions Revisited
- Graphic Submodular Function Minimization: A Graphic Approach and Applications
- A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions
- VLSI Physical Design: From Graph Partitioning to Timing Closure
- Substitutes, Complements and Ripples in Network Flows
- Optimal attack and reinforcement of a network
- Bicriteria Transportation Problem
- Computing the Strength of a Graph
- Minimum cuts and related problems
- Minimizing a Submodular Function on a Lattice
- Community Detection and Stochastic Block Models
- Approximate Hierarchical Clustering via Sparsest Cut and Spreading Metrics
- A Fast Parametric Maximum Flow Algorithm and Applications
- Multi‐objective combinatorial optimization problems: A survey
- A cost function for similarity-based hierarchical clustering
This page was built for publication: Optimal hierarchical clustering on a graph
