Modeling hypergraphs by graphs with the same mincut properties

DOI10.1016/0020-0190(93)90115-PzbMath0768.68147MaRDI QIDQ1209979

S. Singh

Publication date: 16 May 1993

Published in: Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

hypergraphsedge-weighted graphVLSI layoutedge-weighted hypergraphcut propertiescut-modelgraph partitioning algorithms

Mathematics Subject Classification ID

Hypergraphs (05C65) Combinatorics in computer science (68R05) Graph theory (including graph drawing) in computer science (68R10) Applications of graph theory to circuits and networks (94C15)

Related Items (10)

An improved direct labeling method for the max-flow min-cut computation in large hypergraphs and applications ⋮ Hypergraph Cuts with General Splitting Functions ⋮ The Fiedler Vector of a Laplacian Tensor for Hypergraph Partitioning ⋮ Strongly polynomial bounds for multiobjective and parametric global minimum cuts in graphs and hypergraphs ⋮ Weighted fundamental group ⋮ A semidefinite programming approach to the hypergraph minimum bisection problem ⋮ Worst-case ratios of networks in the rectilinear plane ⋮ Relaxation-Based Coarsening for Multilevel Hypergraph Partitioning ⋮ Spectral partitioning with multiple eigenvectors ⋮ Network Flow-Based Refinement for Multilevel Hypergraph Partitioning

Cites Work

• Unnamed Item
• Unnamed Item
• A framework for solving VLSI graph layout problems
• A Gomory-Hu cut tree representation of a netlist partitioning problem
• An Algorithm for Partitioning the Nodes of a Graph

This page was built for publication: Modeling hypergraphs by graphs with the same mincut properties