Approximation techniques for hypergraph partitioning problems

DOI10.1016/0166-218X(93)E0166-VzbMath0824.05048MaRDI QIDQ1891922

Scott W. Hadley

Publication date: 26 October 1995

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

zbMATH Keywords

hypergraphapproximationsweighted graphhypergraph partitioningnode partitioning algorithms

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Graph theory (including graph drawing) in computer science (68R10)

Related Items (2)

Hypergraph Cuts with General Splitting Functions ⋮ Finding part-machine families using graph partitioning techniques

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A parallel graph partitioning algorithm for a message-passing multiprocessor
• A projection technique for partitioning the nodes of a graph
• A Gomory-Hu cut tree representation of a netlist partitioning problem
• Partitioning Sparse Matrices with Eigenvectors of Graphs
• A method for finding minimal bottle-neck cells for grouping part-machine families†
• An Algorithm for Partitioning the Nodes of a Graph
• Design of generalized double rank and multiple rank sequential circuits

This page was built for publication: Approximation techniques for hypergraph partitioning problems