The principal lattice of partitions of a submodular function

DOI10.1016/0024-3795(91)90070-DzbMath0745.05005MaRDI QIDQ1174311

H. Narayanan

Publication date: 25 June 1992

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

zbMATH Keywords

partitionssubmodular functionbipartite graphs

Mathematics Subject Classification ID

Partitions of sets (05A18) Permutations, words, matrices (05A05) Applications of graph theory to circuits and networks (94C15) Lattices (06B99)

Related Items (5)

A faster algorithm for computing the principal sequence of partitions of a graph ⋮ Structures of subpartitions related to a submodular function minimization ⋮ Approximation algorithms for Min-k-overlap problems using the principal lattice of partitions approach ⋮ The realization of finite state machines by decomposition and the principal lattice of partitions of a submodular function. ⋮ LP Relaxation and Tree Packing for Minimum $k$-Cut

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Testing membership in matroid polyhedra
• The ellipsoid method and its consequences in combinatorial optimization
• On the notion of generalized minor in topological network theory and matroids
• The maximum-rank minimum-term-rank theorem for the pivotal transforms of a matrix
• On the minimum hybrid rank of a graph relative to a partition of its edges and its application to electrical network analysis
• Topological transformations of electrical networks
• Connectivity in Matroids

This page was built for publication: The principal lattice of partitions of a submodular function