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

DOI10.1007/BF01069424zbMATH Open0612.05048OpenAlexW2074455982MaRDI QIDQ3752416FDOQ3752416

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

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

zbMATH Keywords

computational complexityalgorithmhypergraphcircuit design

Mathematics Subject Classification ID

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

Cites Work

• Paths, Trees, and Flowers
• Investigation of optimization methods and their applications
• Title not available (Why is that?)

Cited In (17)

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

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)