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

DOI10.1007/BF01069424zbMath0612.05048OpenAlexW2074455982MaRDI QIDQ3752416

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

algorithmcomputational complexityhypergraphcircuit design

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Investigation of optimization methods and their applications
• Paths, Trees, and Flowers

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