scientific article; zbMATH DE number 2075198

MaRDI QIDQ4469670zbMATH OpenFDO

Authors Dorothy Kucar, Shawki Areibi, Anthony Vannelli

Publication date 15 June 2004

zbMATH Keywords

simulated annealing

Mathematics Subject Classification ID

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

Recommendations

• Graph and hypergraph partitioning
• Hypergraph partitioning
• Solution of one problem of optimal partition of the vertex set of a hypergraph
• k-way hypergraph partitioning via n-level recursive bisection
• Parallel multilevel algorithms for hypergraph partitioning

Cited in

(16)

• A note on hypergraph decomposition based on extended minimal sets
• An exact algorithm for min-max hyperstructure equipartition with a connected constraint
• Approximation techniques for hypergraph partitioning problems
• A projection technique for partitioning the nodes of a graph
• Hypergraph partitioning for the parallel computing of fuzzy differential equations
• Special cluster on operations research in electrical and computer engineering: using eigenvectors to partition circuits
• Partitioning hypergraphs in scientific computing applications through vertex separators on graphs
• Hypergraph partitioning
• A global method for the limited K-partitioning of hypergraphs representing optimal design problems in complex machine systems
• Solving graph partitioning problems arising in tagless cache management
• scientific article; zbMATH DE number 66966 (Why is no real title available?)
• Graph and hypergraph partitioning
• Clustering in hypergraphs to minimize average edge service time
• Design and implementation of move-based heuristics for VLSI hypergraph partitioning
• Deterministic Parallel Hypergraph Partitioning
• A method of improving initial partition of Fiduccia-Mattheyses algorithm

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4469670)