The steiner problem in the hypercube

DOI10.1002/net.3230220102zbMath0751.90078OpenAlexW1986908845MaRDI QIDQ3989541

Manley Perkel, Zevi Miller

Publication date: 28 June 1992

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.3230220102

zbMATH Keywords

Steiner problem for a undirected graphSteiner problem for undirected graphs

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60)

Related Items (1)

Applying a result of Frankl and Rödl to the construction of Steiner trees in the hypercube

This page was built for publication: The steiner problem in the hypercube