Solution of one problem of optimal partition of the vertex set of a hypergraph

DOI10.1007/BF01069424MaRDI QIDQ3752416zbMATH OpenOpenAlexFDO

Authors S. N. Trushin

Publication date 1985

Published in Cybernetics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01069424

zbMATH Keywords

computational complexityalgorithmhypergraphcircuit design

Mathematics Subject Classification ID

Hypergraphs (05C65) Applications of graph theory to circuits and networks (94C15)

Recommendations

• scientific article; zbMATH DE number 125474
• An extremal problem for vertex partition of complete multipartite graphs
• On partitioning of hypergraphs
• Partitioning problems in dense hypergraphs
• An efficient algorithm for judicious partition of hypergraphs
• An efficiently solvable graph partition problem to which many problems are reducible
• A note on formulations for the \(A\)-partition problem on hypergraphs
• Minimization and parameterized variants of vertex partition problems on graphs
• Approximation techniques for hypergraph partitioning problems
• A P-complete graph partition problem

Cites work

• scientific article; zbMATH DE number 3679539 (Why is no real title available?)
• Investigation of optimization methods and their applications
• Paths, Trees, and Flowers

Cited in

(17)

• NP-hard and linear variants of hypergraph partitioning
• scientific article; zbMATH DE number 3912287 (Why is no real title available?)
• A fast hypergraph min-cut algorithm for circuit partitioning
• Minimization of the half-perimeters of edges in the arrangement of a hypergraph on a lattice
• scientific article; zbMATH DE number 4168692 (Why is no real title available?)
• An exact algorithm for min-max hyperstructure equipartition with a connected constraint
• An efficient algorithm for judicious partition of hypergraphs
• A linear-time algorithm for the minimum degree hypergraph problem with the consecutive ones property
• Special cluster on operations research in electrical and computer engineering: using eigenvectors to partition circuits
• On partitioning of hypergraphs
• A note on hypergraph decomposition based on extended minimal sets
• An Edge Ordering Problem of Regular Hypergraphs
• scientific article; zbMATH DE number 139787 (Why is no real title available?)
• scientific article; zbMATH DE number 2075198 (Why is no real title available?)
• A global method for the limited K-partitioning of hypergraphs representing optimal design problems in complex machine systems
• A semidefinite programming approach to the hypergraph minimum bisection problem
• A note on formulations for the \(A\)-partition problem on hypergraphs

This page was built for publication: Solution of one problem of optimal partition of the vertex set of a hypergraph

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