Improving graph partitions using submodular functions.

DOI10.1016/S0166-218X(02)00472-9zbMath1073.68703OpenAlexW1970661758MaRDI QIDQ1410700

H. Narayanan, Sachin B. Patkar

Publication date: 14 October 2003

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0166-218x(02)00472-9

zbMATH Keywords

VLSI design automation

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

Related Items (1)

Theory of Principal Partitions Revisited

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Submodular functions and optimization
• Spectral partitioning with multiple eigenvectors
• A faster algorithm for computing the strength of a network
• Submodular functions and electrical networks
• A new approach to the maximum-flow problem
• Selected Applications of Minimum Cuts in Networks
• Computing the Strength of a Graph
• Algorithms for Graphic Polymatroids and Parametrics-Sets
• A Fast Parametric Maximum Flow Algorithm and Applications
• Approximation Algorithms for Min-k-Overlap Problems Using the Principal Lattice of Partitions Approach
• Greedily Finding a Dense Subgraph
• On Nonlinear Fractional Programming

This page was built for publication: Improving graph partitions using submodular functions.